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

NCU Institutional Repository > 工學院 > 土木工程學系 > 期刊論文 > Item 987654321/49781

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/49781

题名:	An ant colony system-based hybrid algorithm for square root concave cost transhipment problems
作者:	Yan,S;Shih,YL;Wang,CL
贡献者:	土木工程學系
日期:	2010
上传时间:	2012-03-27 16:16:34 (UTC+8)
出版者:	國立中央大學
摘要:	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.
關聯:	ENGINEERING OPTIMIZATION
显示于类别:	[土木工程學系 ] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	385	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing