An ant colony system-based hybrid algorithm for square root concave cost transhipment problems

NCUIR > Engineering College > Department of Civil Engineering > journal & Dissertation > Item 987654321/49781

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/49781

Title:	An ant colony system-based hybrid algorithm for square root concave cost transhipment problems
Authors:	Yan,S;Shih,YL;Wang,CL
Contributors:	土木工程學系
Date:	2010
Issue Date:	2012-03-27 16:16:34 (UTC+8)
Publisher:	國立中央大學
Abstract:	Concave cost transhipment problems are difficult to optimally solve for large-scale problems within a limited period of time. Recently, some modern meta-heuristics have been employed for the development of advanced local search based or population-based stochastic search algorithms that can improve the conventional heuristics. Besides these meta-heuristics, the ant colony system algorithm is a population-based stochastic search algorithm which has been used to obtain good results in many applications. This study employs the ant colony system algorithm, coupled with some genetic algorithm and threshold accepting algorithm techniques, to develop a population based stochastic search algorithm for efficiently solving square root concave cost transhipment problems. The developed algorithms are evaluated with a number of problem instances. The results indicate that the proposed algorithm is more effective for solving square root concave cost transhipment problems than other recently designed local search based algorithms and genetic algorithm.
Relation:	ENGINEERING OPTIMIZATION
Appears in Collections:	[Department of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	392	View/Open

社群 sharing