A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems

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

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

题名:	A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems
作者:	Yan,SY;Shih,YL;Lee,WT
贡献者:	土木工程學系
关键词:	LOCAL SEARCH ALGORITHMS;TABU-SEARCH
日期:	2011
上传时间:	2012-03-27 16:17:18 (UTC+8)
出版者:	國立中央大學
摘要:	Traditionally, minimum cost transshipment problems have been simplified as linear cost problems, which are not practical in real applications. Some advanced local search algorithms have been developed to solve concave cost bipartite network problems. These have been found to be more effective than the traditional linear approximation methods and local search methods. Recently, a genetic algorithm and an ant colony system algorithm were employed to develop two global search algorithms for solving concave cost transshipment problems. These two global search algorithms were found to be more effective than the advanced local search algorithms for solving concave cost transshipment problems. Although the particle swarm optimization algorithm has been used to obtain good results in many applications, to the best of our knowledge, it has not yet been applied in minimum concave cost network flow problems. Thus, in this study, we employ an arc-based particle swarm optimization algorithm, coupled with some genetic algorithm and threshold accepting method techniques, as well as concave cost network heuristics, to develop a hybrid global search algorithm for efficiently solving minimum cost network flow problems with concave arc costs. The proposed algorithm is evaluated by solving several randomly generated network flow problems. The results indicate that the proposed algorithm is more effective than several other recently designed methods, such as local search algorithms, genetic algorithms and ant colony system algorithms, for solving minimum cost network flow problems with concave arc costs.
關聯:	JOURNAL OF GLOBAL OPTIMIZATION
显示于类别:	[土木工程學系 ] 期刊論文

文件中的档案:

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

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

社群 sharing

数据加载中.....