A hybrid genetic algorithm for the multi-depot open vehicle routing problem

This paper studies the multi-depot open vehicle routing problem (MDOVRP), a variant of the vehicle routing problem (VRP), in which vehicles start from several depots and are not required to return to the depot. Despite the vast amount of literature about VRPs, the MDOVRP has received very little attention from researchers. In this paper, a new hybrid genetic algorithm is presented for finding the routes that minimize the traveling cost of the vehicles. Computational results on a number of test instances indicate the proposed algorithm dominates the CPLEX solver and the existing approach in the literature. Meanwhile, experiments are conducted on multi-depot VRP benchmarks, and the results are compared with a sophisticated tabu search approach and an exact method.

[1]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[2]  Panagiotis P. Repoussis,et al.  The open vehicle routing problem with time windows , 2007, J. Oper. Res. Soc..

[3]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[4]  Gilbert Laporte,et al.  A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars , 2010, Eur. J. Oper. Res..

[5]  Christian Prins,et al.  Two memetic algorithms for heterogeneous fleet vehicle routing problems , 2009, Eng. Appl. Artif. Intell..

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

[7]  Paolo Toth,et al.  An ILP improvement procedure for the Open Vehicle Routing Problem , 2008, Comput. Oper. Res..

[8]  Bruce L. Golden,et al.  The open vehicle routing problem: Algorithms, large-scale test problems, and computational results , 2007, Comput. Oper. Res..

[9]  Nubia Velasco,et al.  A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands , 2008, Comput. Oper. Res..

[10]  Wen-Chyuan Chiang,et al.  Integrating multi-product production and distribution in newspaper logistics , 2008, Comput. Oper. Res..

[11]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[12]  Gilbert Laporte,et al.  A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..

[13]  Jesuk Ko,et al.  A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling , 2003, Comput. Oper. Res..

[14]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[15]  Christos D. Tarantilis,et al.  Distribution of fresh meat , 2002 .

[16]  Alain Hertz,et al.  Guidelines for the use of meta-heuristics in combinatorial optimization , 2003, Eur. J. Oper. Res..

[17]  Gilbert Laporte,et al.  A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem , 2003, Eur. J. Oper. Res..

[18]  Henry C. W. Lau,et al.  Application of Genetic Algorithms to Solve the Multidepot Vehicle Routing Problem , 2010, IEEE Transactions on Automation Science and Engineering.

[19]  Ian C. Parmee,et al.  Preferences and their application in evolutionary multiobjective optimization , 2002, IEEE Trans. Evol. Comput..

[20]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

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

[22]  Herman R. Leep,et al.  A vehicle routing problem solved by using a hybrid genetic algorithm , 2007, Comput. Ind. Eng..

[23]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[24]  Xiao Liu,et al.  Task Selection and Routing Problems In Collaborative Truckload Transportation , 2010 .

[25]  D Sariklis,et al.  A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..

[26]  Bruce L. Golden,et al.  A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions , 1993 .

[27]  Roberto Baldacci,et al.  A unified exact method for solving different classes of vehicle routing problems , 2009, Math. Program..

[28]  Mohamed Barkaoui,et al.  A parallel hybrid genetic algorithm for the vehicle routing problem with time windows , 2004, Comput. Oper. Res..

[29]  Shuguang Liu,et al.  An effective genetic algorithm for the fleet size and mix vehicle routing problems , 2009 .

[30]  José Brandão,et al.  A tabu search algorithm for the open vehicle routing problem , 2004, Eur. J. Oper. Res..

[31]  Richard W. Eglese,et al.  A new tabu search heuristic for the open vehicle routing problem , 2005, J. Oper. Res. Soc..

[32]  C. D. Tarantilis,et al.  A list-based threshold accepting method for job shop scheduling problems , 2002 .

[33]  Henry C. W. Lau,et al.  A hybrid genetic algorithm for the multi-depot vehicle routing problem , 2008, Eng. Appl. Artif. Intell..

[34]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[35]  Panagiotis P. Repoussis,et al.  A hybrid evolution strategy for the open vehicle routing problem , 2010, Comput. Oper. Res..

[36]  Jürgen Branke,et al.  A Fast Look-ahead Heuristic for the Multi-depot Vehicle Routing Problem , 2007, Wirtschaftsinformatik.

[37]  Andrew Lim,et al.  Multi-depot vehicle routing problem: a one-stage approach , 2005, IEEE Transactions on Automation Science and Engineering.

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

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

[40]  Xin Yao,et al.  Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems , 2009, IEEE Transactions on Evolutionary Computation.

[41]  Christos D. Tarantilis,et al.  Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm , 2005, J. Oper. Res. Soc..

[42]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[43]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[44]  Emmanouil E. Zachariadis,et al.  An open vehicle routing problem metaheuristic for examining wide solution neighborhoods , 2010, Comput. Oper. Res..

[45]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[46]  Kenneth Sörensen,et al.  MA mid PM: memetic algorithms with population management , 2006, Comput. Oper. Res..

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

[48]  Said Salhi,et al.  A multi-level composite heuristic for the multi-depot vehicle fleet mix problem , 1997 .