Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1166.90319
Chen, Ailing; Yang, Genke; Wu, Zhiming
Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. (English)
[J] J. Zhejiang Univ., Sci. A 7, No. 4, 607-614 (2006). ISSN 1673-565X

Summary: Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid approximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimization (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.

MSC 2000:: *90B20 Highway traffic
90C10 Integer programming

Keywords: capacitated routing problem; discrete particle swarm optimization (DPSO); simulated annealing (SA)

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]