Title :
Solving Capacitated Vehicle Routing Problems via Genetic Particle Swarm Optimization
Author_Institution :
Dept. of Comput. Eng., Hubei Univ. of Educ., Wuhan, China
Abstract :
A modified genetic particle swarm optimization method (MGPSO) is employed to solve the capacitated vehicle routing problems (CVRP). MGPSO was derived from the standard particle swarm optimization (PSO) and incorporated with the genetic reproduction mechanisms, namely crossover and mutation. MGPSO employs an integer encoding and decoding representation, which is suitable for combinatorial optimization problems and it is easy to be implemented. Moreover, with the encoding and decoding, it can adjust the number of vehicles needed, dynamically and adaptively. A modified ordering crossover is employed to perform the crossover based on the PSO mechanisms to exchange building blocks with personal and global experiences. The proposed method has been implemented to five well-known CVRP benchmarks, and by comparison with the other evolutionary algorithms, the simulation results have shown the feasibility and effectiveness.
Keywords :
combinatorial mathematics; decoding; encoding; evolutionary computation; particle swarm optimisation; transportation; vehicles; capacitated vehicle routing problems; combinatorial optimization problems; decoding representation; evolutionary algorithms; genetic reproduction mechanisms; integer encoding; modified genetic particle swarm optimization method; modified ordering crossover; Ant colony optimization; Decoding; Encoding; Evolutionary computation; Genetic mutations; Information technology; Intelligent vehicles; Particle swarm optimization; Routing; Supply chain management; Vehicle routing; particle swarm optimization; supply chain management;
Conference_Titel :
Intelligent Information Technology Application, 2009. IITA 2009. Third International Symposium on
Conference_Location :
Nanchang
Print_ISBN :
978-0-7695-3859-4
DOI :
10.1109/IITA.2009.34