Hybrid particle swarm optimization for vehicle routing problem with time windows

Vehicle routing problem with Time Window (VRPTW) has received much attention by researchers in solving many scheduling applications for transportation and logistics. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with various demands and time window constraints. As a non-polynomial (NP) hard problem, the VRPTW is complex and time consuming, especially when it involves a large number of customers and constraints. This paper presents a hybrid approach between Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) for solving VRPTW. The reason for hybridization is to overcome the problem of premature convergence that exists in standard PSO. Premature convergence often yields partially optimized solutions because of particles stagnation. The proposed hybrid PSO implements a mechanism that automatically trigger swarm condition which will liberate particles from sub-optimal solutions hence enabling progress toward the maximum best solution. A computational experiment has been carried out by running the hybrid PSO with the VRPTW benchmark data set. The results indicate that the algorithm can produce some improvement when compared to the original PSO.

[1]  Lixin Tang,et al.  A new hybrid ant colony optimization algorithm for the vehicle routing problem , 2009, Pattern Recognit. Lett..

[2]  M. M. Ali,et al.  Improved particle swarm algorithms for global optimization , 2008, Appl. Math. Comput..

[3]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[4]  Ying Tan,et al.  Particle swarm optimization with triggered mutation and its implementation based on GPU , 2010, GECCO '10.

[5]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[6]  Gen-ke Yang,et al.  Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem , 2006 .

[7]  Hitoshi Iba,et al.  Particle swarm optimization with Gaussian mutation , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[8]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[9]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[10]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[11]  Guiyun Li Research on Open Vehicle Routing Problem with Time Windows Based on Improved Genetic Algorithm , 2009, 2009 International Conference on Computational Intelligence and Software Engineering.

[12]  Tong Zhen,et al.  Hybrid Particle Swarm Algorithm for Grain Logistics Vehicle Routing Problem , 2009, 2009 Third International Symposium on Intelligent Information Technology Application.

[13]  Paul S. Andrews,et al.  An Investigation into Mutation Operators for Particle Swarm Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[14]  Magdalene Marinaki,et al.  A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..

[15]  Voratas Kachitvichyanukul,et al.  A particle swarm optimization for the capacitated vehicle routing problem , 2007 .