An artificial bee colony algorithm for the capacitated vehicle routing problem

This paper introduces an artificial bee colony heuristic for solving the capacitated vehicle routing problem. The artificial bee colony heuristic is a swarm-based heuristic, which mimics the foraging behavior of a honey bee swarm. An enhanced version of the artificial bee colony heuristic is also proposed to improve the solution quality of the original version. The performance of the enhanced heuristic is evaluated on two sets of standard benchmark instances, and compared with the original artificial bee colony heuristic. The computational results show that the enhanced heuristic outperforms the original one, and can produce good solutions when compared with the existing heuristics. These results seem to indicate that the enhanced heuristic is an alternative to solve the capacitated vehicle routing problem.

[1]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

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

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

[4]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[5]  Junjie Li,et al.  Structural inverse analysis by hybrid simplex artificial bee colony algorithms , 2009 .

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

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

[8]  Yuichi Nagata,et al.  Edge assembly‐based memetic algorithm for the capacitated vehicle routing problem , 2009, Networks.

[9]  Shih-Wei Lin,et al.  Applying hybrid meta-heuristics for capacitated vehicle routing problem , 2009, Expert Syst. Appl..

[10]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[11]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[12]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

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

[14]  Michel Gendreau,et al.  New Heuristics for the Vehicle Routing Problem , 2005 .

[15]  Olli Bräysy,et al.  Active-guided evolution strategies for large-scale capacitated vehicle routing problems , 2007, Comput. Oper. Res..

[16]  Manoj Kumar Tiwari,et al.  Swarm Intelligence, Focus on Ant and Particle Swarm Optimization , 2007 .

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

[18]  Christos D. Tarantilis,et al.  BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management , 2002, Ann. Oper. Res..

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

[20]  Angel A. Juan,et al.  The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem , 2008 .

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

[22]  Jeffrey L. Rummel,et al.  A Subpath Ejection Method for the Vehicle Routing Problem , 1998 .

[23]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

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

[25]  Derviş Karaboğa,et al.  NEURAL NETWORKS TRAINING BY ARTIFICIAL BEE COLONY ALGORITHM ON PATTERN CLASSIFICATION , 2009 .

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

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

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

[29]  Michel Gendreau,et al.  Metaheuristics in Vehicle Routing , 2012, International Conference on Operations Research and Enterprise Systems.

[30]  Alkin Yurtkuran,et al.  A new Hybrid Electromagnetism-like Algorithm for capacitated vehicle routing problems , 2010, Expert Syst. Appl..

[31]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

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

[33]  Nurhan Karaboga,et al.  A new design method based on artificial bee colony algorithm for digital IIR filters , 2009, J. Frankl. Inst..

[34]  Bruce L. Golden,et al.  Very large-scale vehicle routing: new test problems, algorithms, and results , 2005, Comput. Oper. Res..

[35]  Christos D. Tarantilis,et al.  Solving the vehicle routing problem with adaptive memory programming methodology , 2005, Comput. Oper. Res..

[36]  Michel Gendreau,et al.  Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

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

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

[39]  Viale Risorgimento,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003 .

[40]  Kenneth Sörensen,et al.  Optimisation of water distribution network design: a critical review , 2012 .

[41]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[42]  Lale Özbakır,et al.  Artificial Bee Colony Algorithm and Its Application to Generalized Assignment Problem , 2007 .

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

[44]  Ulrich Derigs,et al.  Applying the attribute based hill climber heuristic to the vehicle routing problem , 2007, Eur. J. Oper. Res..

[45]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[46]  Alok Singh,et al.  An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem , 2009, Appl. Soft Comput..

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

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

[49]  Leyuan Shi,et al.  A New Hybrid Genetic Algorithm , 2007 .

[50]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[51]  Michel Gendreau,et al.  Path relinking for the vehicle routing problem , 2004, J. Heuristics.