A Novel Ant Colony Optimization Algorithm for the Vehicle Routing Problem

The Vehicle Routing Problem VRP is one of the most important problems in the field of Operations Research and logistics. This paper presents a novel Ant Colony Optimization algorithm abbreviated as ACO_PLM to solve the Vehicle Routing Problem efficiently. By virtue of this algorithm we wish to propose novel pheromone deposition, local search & mutation strategies to solve the VRP efficiently and facilitate rapid convergence. The ACO_PLM provides better results compared to other heuristics, which is apparent from the experimental results and comparisons with other existing algorithms when tested on the twelve benchmark instances.

[1]  Paolo Toth,et al.  The vehicle routing problem , 2001 .

[2]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[3]  Jean Berger,et al.  A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows , 1998, Canadian Conference on AI.

[4]  Baozhen Yao,et al.  Production , Manufacturing and Logistics An improved ant colony optimization for vehicle routing problem , 2008 .

[5]  Rainer Leisten,et al.  Flowshop sequencing problems with limited buffer storage , 1990 .

[6]  Amit Konar,et al.  Stability analysis of the ant system dynamics with non-uniform pheromone deposition rules , 2007, 2007 IEEE Congress on Evolutionary Computation.

[7]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[8]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[9]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[10]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[11]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

[12]  Magdalene Marinaki,et al.  A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem , 2010, Comput. Oper. Res..

[13]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[14]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[15]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[16]  Karl F. Doerner,et al.  A Savings Based Ant System For The Vehicle Routing Problem , 2002, GECCO.

[17]  Mahmoud A. Abo-Sinna,et al.  An effective genetic algorithm approach to multiobjective routing problems (MORPs) , 2005, Appl. Math. Comput..

[18]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[19]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[20]  Chia-Ho Chen,et al.  AN IMPROVED ANT COLONY SYSTEM ALGORITHM FOR THE VEHICLE ROUTING PROBLEM , 2006 .