An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem

This problem involves optimizing product collection and redistribution from production locations to a set of processing plants over a planning horizon. This horizon consists of several days, and the collection-redistribution is performed on a repeating daily basis. A single routing plan must be prepared for the whole horizon, taking into account the seasonal variations in the supply. We model the problem using a sequence of periods, each corresponding to a season. We propose an adaptive large-neighborhood search with several specifically designed operators and features. The results show the excellent performance of the algorithm in terms of solution quality and computational efficiency.

[1]  Fabien Lehuédé,et al.  An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers , 2011, Transp. Sci..

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

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Jörg Homberger,et al.  A two-phase hybrid metaheuristic for the vehicle routing problem with time windows , 2005, Eur. J. Oper. Res..

[5]  Michel Gendreau,et al.  Heuristics for multi-attribute vehicle routing problems: A survey and synthesis , 2013, Eur. J. Oper. Res..

[6]  Hrvoje Gold,et al.  Vehicle Routing Problem , 2008, Encyclopedia of GIS.

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

[8]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

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

[10]  Russell Bent,et al.  A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..

[11]  Michel Gendreau,et al.  Multi-thread integrative cooperative optimization for rich combinatorial problems , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[12]  Michal Tzur,et al.  The Period Vehicle Routing Problem and its Extensions , 2008 .

[13]  Michel Gendreau,et al.  A column generation approach for a multi-attribute vehicle routing problem , 2015, Eur. J. Oper. Res..

[14]  F. Sibel Salman,et al.  An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem , 2014, Eur. J. Oper. Res..

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

[16]  Charles Audet,et al.  Optimization of algorithms with OPAL , 2012, Math. Program. Comput..

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

[18]  Gilbert Laporte,et al.  The dynamic multi-period vehicle routing problem , 2010, Comput. Oper. Res..

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

[20]  L. N. Wassenhove,et al.  Collection and Vehicle Routing Issues in Reverse Logistics , 2004 .

[21]  Gilbert Laporte,et al.  The dynamic multiperiod vehicle routing problem with probabilistic information , 2014, Comput. Oper. Res..

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

[23]  Martin W. P. Savelsbergh,et al.  Competitive analysis for dynamic multiperiod uncapacitated routing problems , 2007 .

[24]  Simona Mancini,et al.  A real-life Multi Depot Multi Period Vehicle Routing Problem with a Heterogeneous Fleet: Formulation and Adaptive Large Neighborhood Search based Matheuristic , 2016 .

[25]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

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

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

[28]  Hermann Gehring,et al.  A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .

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

[30]  Christos D. Tarantilis,et al.  A template-based Tabu Search algorithm for the Consistent Vehicle Routing Problem , 2012, Expert Syst. Appl..

[31]  David Pisinger,et al.  Large Neighborhood Search , 2018, Handbook of Metaheuristics.

[32]  Sanne Wøhlk,et al.  Collection of recyclables from cubes – A case study , 2014 .

[33]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

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

[35]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

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

[37]  O. Bräysy,et al.  A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows , 2003 .

[38]  Θεόδωρος Αθανασόπουλος.  The multi-period vehicle routing problem and its applications , 2011 .

[39]  Maria Grazia Speranza,et al.  The application of a vehicle routing model to a waste-collection problem: two case studies , 2002, J. Oper. Res. Soc..

[40]  Teodor Gabriel Crainic,et al.  Explicit and Emergent Cooperation Schemes for Search Algorithms , 2008, LION.

[41]  Luc Muyldermans,et al.  On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm , 2010, Eur. J. Oper. Res..

[42]  Michel Gendreau,et al.  An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP , 2015, Eur. J. Oper. Res..

[43]  Teodor Gabriel Crainic,et al.  Parallel Solution Methods for Vehicle Routing Problems , 2008 .

[44]  Michel Gendreau,et al.  Multi-period capacity expansion for a local access telecommunications network , 2006, Eur. J. Oper. Res..

[45]  Michel Gendreau,et al.  Heuristics for multi-period capacity expansion in local telecommunications networks , 2009, J. Heuristics.

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

[47]  Sanne Wøhlk,et al.  A variable neighborhood search for the multi-period collection of recyclable materials , 2016, Eur. J. Oper. Res..

[48]  Gilbert Laporte,et al.  The inventory-routing problem with transshipment , 2012, Comput. Oper. Res..

[49]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[50]  Roberto Musmanno,et al.  An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[51]  Michel Gendreau,et al.  A path relinking algorithm for a multi-depot periodic vehicle routing problem , 2013, J. Heuristics.

[52]  Bruce L. Golden,et al.  The Consistent Vehicle Routing Problem , 2009, Manuf. Serv. Oper. Manag..

[53]  Dennis Huisman,et al.  A comparison of five heuristics for the multiple depot vehicle scheduling problem , 2009, J. Sched..

[54]  Michel Gendreau,et al.  A branch-and-price approach for a multi-period vehicle routing problem , 2015, Comput. Oper. Res..

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

[56]  Jean-François Cordeau,et al.  Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem , 2011, Transp. Sci..

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

[58]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[59]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

[60]  Michel Gendreau,et al.  Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography , 2008 .

[61]  Gilbert Laporte,et al.  A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia☆ , 2015 .

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

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

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

[65]  Michel Gendreau,et al.  Strategic analysis of the dairy transportation problem , 2015, J. Oper. Res. Soc..

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