Home > Table of Contents


Proceedings of 2009 International Symposium on Computer Science and Computational Technology (ISCSCT 2009)

Huangshan, China, December 26-28, 2009

Editors: Fei Yu, Guangxue Yue, Jian Shu, Yun Liu

AP Catalog Number: AP-PROC-CS-09CN005

ISBN: 978-952-5726-07-7 (Print), 978-952-5726-08-4 (CD-ROM)

Page(s): 266-269

A Single–depot Complex Vehicle Routing Problem and its PSO Solution

        Lei Yin and Xiaoxiang Liu

Full text:  PDF


This paper discusses a single-depot complex vehicle routing problem (SCVRP), of which the conditions are that the total routine shall be the shortest and the biggest marched routine of any single vehicle as well. A single objective model is set up upon these conditions. Accordingly, this paper proposes an improved PSO algorithm (GPSO) combined with the crossover operation of genetic algorithm (GA). It can avoid being trapped in local optimum due to using probability searching. GPSO is applied to SCVRP, and cases testify to its feasibility and effectiveness.

Index Terms

Particle Swarm Optimization, vehicle routing problem, genetic algorithm

Copyright @ 2009 ACADEMY PUBLISHER — All rights reserved