On Solutions to Capacitated Vehicle Routing Problem Using an Enhanced Ant Colony Optimization Technique

This paper presents an enhanced ant colony optimization (ACO) algorithm for solving the capacitated vehicle routing problem (CVRP). CVRP is the most elementary version of VRP, but also a difficult combinatorial problem which contains both the TSP (routing) and BPP (packing) problems as special cases. In the CVRP a number of vehicles having uniform capacity starts and terminates at a common depot, services a set of customers with certain demands at minimum transit cost. In this paper, an enhanced version of ACO algorithm is implemented on Fisher and Christofides benchmark problems. Computational results compared with the performance of different algorithms and relaxations are presented. These results indicate that the proposed algorithm is a comparative approach to solve CVRP. The article is concluded by examining the possible future research directions in this field.

[1]  James B. Orlin,et al.  Creating very large scale neighborhoods out of smaller ones by compounding moves , 2006, J. Heuristics.

[2]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[3]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[4]  Georgios Dounias,et al.  Honey Bees Mating Optimization algorithm for large scale vehicle routing problems , 2010, Natural Computing.

[5]  Christian Prins,et al.  A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[6]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[7]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[8]  Ping Chen,et al.  Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem , 2010, Expert Syst. Appl..

[9]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[10]  Gilbert Laporte,et al.  A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows , 2009, Eur. J. Oper. Res..

[11]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[12]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[13]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

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

[15]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[16]  Voratas Kachitvichyanukul,et al.  Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem , 2009, Comput. Ind. Eng..

[17]  Karuppusamy Kanthavel,et al.  Optimization of Capacitated Vehicle Routing Problem by Nested Particle Swarm Optimization , 2011 .

[18]  Jean Berger,et al.  A new hybrid genetic algorithm for the capacitated vehicle routing problem , 2003, J. Oper. Res. Soc..

[19]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[20]  Paolo Toth,et al.  Exact algorithms for routing problems under vehicle capacity constraints , 2010, Ann. Oper. Res..

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

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

[23]  Enrique Alba,et al.  The exploration/exploitation tradeoff in dynamic cellular genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.