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

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

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

Title:	A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems
Authors:	Yan,SY;Shih,YL;Lee,WT
Contributors:	土木工程學系
Keywords:	LOCAL SEARCH ALGORITHMS;TABU-SEARCH
Date:	2011
Issue Date:	2012-03-27 16:17:18 (UTC+8)
Publisher:	國立中央大學
Abstract:	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.
Relation:	JOURNAL OF GLOBAL OPTIMIZATION
Appears in Collections:	[Department of Civil Engineering] journal & Dissertation

Files in This Item:

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

社群 sharing

Loading...