Heuristics Based Particle Swarm Optimization for Solving Vehicle Routing Problems

Author

Ruey-Maw Chen ; You-An Chen

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., NCUT, Taichung, Taiwan

fYear

2014

fDate

10-12 June 2014

Firstpage

360

Lastpage

363

Abstract

Particle swarm optimization (PSO) is adopted to solve capacitated vehicle routing problems (CVRPs). A nonlinear S decrease curve is employed to adjust the inertia weight of PSO to balance global and local searches. Meanwhile, local search and path relink are also involved to improve the quality of solutions. Experiments were conducted on Auger at problems in the OR Library. Experimental results will were compared with those from other studies. Experimental results prove the algorithm designed in this article can effectively solve capacitated type vehicle routing problems.

Keywords

logistics; particle swarm optimisation; search problems; vehicle routing; CVRP; PSO; capacitated vehicle routing problem; heuristics based particle swarm optimization; inertia weight; local search; nonlinear S decrease curve; path relink; Algorithm design and analysis; Job shop scheduling; Particle swarm optimization; Processor scheduling; Vectors; Vehicle routing; Vehicles; Capacitated Vehicle Routing Problem (CVRP); Meta-heuristic; Optimization; Particle Swarm Optimization (PSO); Vehicle Routing Problem (VRP);

fLanguage

English

Publisher

ieee

Conference_Titel

Computer, Consumer and Control (IS3C), 2014 International Symposium on

Conference_Location

Taichung

Type

conf

DOI

10.1109/IS3C.2014.100

Filename

6845892