Adaptive search techniques for problems in vehicle routing, Part I: A survey

Abstract: Research in the field of vehicle routing often focuse on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show that algorithms with generic adaptive policies - which emerged in the past years - are more efficient to solve complex vehicle routing problems. In this first part of the survey, we present an overview of recent literature dealing with adaptive or guided search techniques for problems in vehicle routing. Keywords: Adaptive strategies, local search, metaheuristics, vehicle routing. MSC: 90B06, 90C05, 90C08

[1]  Lionel Amodeo,et al.  Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services , 2014, Comput. Oper. Res..

[2]  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.

[3]  Stephen C. H. Leung,et al.  Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem , 2011, Comput. Oper. Res..

[4]  Pierre Hansen,et al.  Variable Neighborhood Search : Methods and Applications , 2008 .

[5]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[6]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[7]  Robert H. Storer,et al.  An approximate dynamic programming approach for the vehicle routing problem with stochastic demands , 2009, Eur. J. Oper. Res..

[8]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[9]  Richard F. Hartl,et al.  A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2008 .

[10]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[11]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[12]  Gilbert Laporte,et al.  An adaptive large neighborhood search heuristic for the Pollution-Routing Problem , 2012, Eur. J. Oper. Res..

[13]  Daniele Vigo,et al.  An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping , 2013, Transp. Sci..

[14]  Mauro Brunato,et al.  Reactive Search Optimization: Learning While Optimizing , 2018, Handbook of Metaheuristics.

[15]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

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

[17]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

[19]  Richard F. Hartl,et al.  A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[20]  Emmanouil E. Zachariadis,et al.  An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries , 2010, Eur. J. Oper. Res..

[21]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[22]  E. Tsang,et al.  Guided Local Search , 2010 .

[23]  Emmanouil E. Zachariadis,et al.  A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities , 2008, INFORMS J. Comput..

[24]  Luca Di Gaspero,et al.  A composite-neighborhood tabu search approach to the traveling tournament problem , 2007, J. Heuristics.

[25]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[26]  El-Ghazali Talbi,et al.  Adaptive particle swarm for solving the Dynamic Vehicle Routing Problem , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.

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

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

[29]  Thibaut Vidal,et al.  A memetic algorithm for the Multi Trip Vehicle Routing Problem , 2014, Eur. J. Oper. Res..

[30]  Michel Gendreau,et al.  A dynamic vehicle routing problem with multiple delivery routes , 2011, Annals of Operations Research.

[31]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[32]  Tore Grünert,et al.  Sequential search and its application to vehicle-routing problems , 2006, Comput. Oper. Res..

[33]  Thomas Stützle,et al.  Ant Colony Optimization: Overview and Recent Advances , 2018, Handbook of Metaheuristics.

[34]  Richard F. Hartl,et al.  Adaptive search techniques for problems in vehicle routing, Part II: A numerical comparison , 2014 .

[35]  Emmanouil E. Zachariadis,et al.  A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints , 2009, Eur. J. Oper. Res..

[36]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

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

[39]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

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

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

[42]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[43]  Christine L. Mumford,et al.  Solving the One-Commodity Pickup and Delivery Problem Using an Adaptive Hybrid VNS/SA Approach , 2010, PPSN.

[44]  Michel Gendreau,et al.  An Adaptive Large Neighborhood Search for a Vehicle Routing Problem with Multiple Trips , 2010 .

[45]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[46]  Jean-Yves Potvin,et al.  Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier , 2011, J. Oper. Res. Soc..

[47]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[48]  Mohamed Reghioui,et al.  Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows , 2013, Central Eur. J. Oper. Res..

[49]  Juan José Salazar González,et al.  Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem , 2004, Transp. Sci..

[50]  Jean-François Cordeau,et al.  A parallel iterated tabu search heuristic for vehicle routing problems , 2012, Comput. Oper. Res..

[51]  Michel Gendreau,et al.  A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints , 2008, Networks.

[52]  Anand Subramanian,et al.  A hybrid algorithm for a class of vehicle routing problems , 2013, Comput. Oper. Res..

[53]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[54]  Emmanouil E. Zachariadis,et al.  A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service , 2009, Expert Syst. Appl..

[55]  Thomas Stützle,et al.  Stochastic Local Search , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[56]  Pascal Van Hentenryck,et al.  A simulated annealing approach to the traveling tournament problem , 2006, J. Sched..

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

[58]  Anand Subramanian,et al.  An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries , 2013, J. Oper. Res. Soc..

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

[60]  Bo Guo,et al.  The capacitated vehicle routing problem with stochastic demands and time windows , 2011, Comput. Oper. Res..

[61]  M. Gendreau.  A Hybrid Genetic Algorithm for Multi-Depot and Periodic Vehicle Routing Problems , 2010 .

[62]  Michel Gendreau,et al.  A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..

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

[64]  C. D. J. Waters.  A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement , 1987 .

[65]  Yves Crama,et al.  An adaptive large neighborhood search for a vehicle routing problem with multiple trips and driver shifts , 2013 .

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

[67]  Irene Loiseau,et al.  An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows , 2011, Comput. Oper. Res..

[68]  Günther R. Raidl,et al.  Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem , 2010, Hybrid Metaheuristics.

[69]  Puca Huachi Vaz Penna,et al.  An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem , 2013, J. Heuristics.

[70]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[71]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

[72]  Li-Chen Fu,et al.  A VNS-based hyper-heuristic with adaptive computational budget of local search , 2012, 2012 IEEE Congress on Evolutionary Computation.

[73]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

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

[75]  Richard F. Hartl,et al.  Adaptive large neighborhood search for service technician routing and scheduling problems , 2012, J. Sched..

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

[77]  Edward P. K. Tsang,et al.  Applying an Extended Guided Local Search to the Quadratic Assignment Problem , 2003, Ann. Oper. Res..

[78]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.

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

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

[81]  Michel Gendreau,et al.  A unified solution framework for multi-attribute vehicle routing problems , 2014, Eur. J. Oper. Res..

[82]  Philippe Lacomme,et al.  A GRASP×ELS approach for the capacitated location-routing problem , 2010, Comput. Oper. Res..

[83]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

[84]  Richard F. Hartl,et al.  A variable neighborhood search heuristic for periodic routing problems , 2009, Eur. J. Oper. Res..

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

[86]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[87]  Christelle Guéret,et al.  An event-driven optimization framework for dynamic vehicle routing , 2012, Decis. Support Syst..

[88]  Richard F. Hartl,et al.  Variable neighborhood search for the dial-a-ride problem , 2010, Comput. Oper. Res..

[89]  Christian Prins,et al.  An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..

[90]  Gilbert Laporte,et al.  The multi-depot vehicle routing problem with inter-depot routes , 2007, Eur. J. Oper. Res..

[91]  Michel Gendreau,et al.  A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..