Edge assembly‐based memetic algorithm for the capacitated vehicle routing problem

Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) to efficiently service a number of demand or supply points. In this paper a new memetic algorithm is suggested for the standard capacitated vehicle routing problem. The proposed algorithm combines the edge assembly (EAX) crossover with two well-known local searches and allows for infeasible solutions with respect to capacity constraint during the search. To address the constraint violation, an efficient modification algorithm is also suggested. Experimental tests on 32 standard benchmarks demonstrate that the suggested method is robust and competitive, finding the best-known solution to 28 problems and new best-known solution to 12 well-studied instances in a reasonable computing time.

[1]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[2]  Philippe Lacomme,et al.  Evolutionary algorithms for periodic arc routing problems , 2005, Eur. J. Oper. Res..

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

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

[5]  Wout Dullaert,et al.  A multi-parametric evolution strategies algorithm for vehicle routing problems , 2007, Expert Syst. Appl..

[6]  Olli Bräysy,et al.  Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..

[7]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[8]  Yuichi Nagata.  New EAX Crossover for Large TSP Instances , 2006, PPSN.

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

[10]  Paolo Toth,et al.  Branch-And-Bound Algorithms for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[11]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

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

[13]  David Simchi-Levi,et al.  Set-Covering-Based Algorithms for the Capacitated VRP , 2001, The Vehicle Routing Problem.

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

[15]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[16]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[17]  Shigenobu Kobayashi,et al.  Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.

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

[19]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

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

[21]  Abdellah El-Fallahi,et al.  A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..

[22]  Giovanni Rinaldi,et al.  Branch-And-Cut Algorithms for the Capacitated VRP , 2001, The Vehicle Routing Problem.

[23]  Enrique Alba,et al.  Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm , 2006, Inf. Process. Lett..

[24]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

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

[26]  A. Dickson.  On Evolution , 1884, Science.

[27]  Reza Tavakkoli-Moghaddam,et al.  A memetic algorithm for a vehicle routing problem with backhauls , 2006, Appl. Math. Comput..

[28]  Yuichi Nagata,et al.  Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems , 2006, EvoCOP.

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