An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization

The two-echelon vehicle routing problem (2E-VRP) consists in making deliveries to a set of customers using two distinct fleets of vehicles. First-level vehicles pick up requests at a distribution center and bring them to intermediate sites. At these locations, the requests are transferred to second-level vehicles, which deliver them. This paper addresses a variant of the 2E-VRP that integrates constraints arising in city logistics such as time window constraints, synchronization constraints, and multiple trips at the second level. The corresponding problem is called the two-echelon multiple-trip vehicle routing problem with satellite synchronization (2E-MTVRP-SS). We propose an adaptive large neighborhood search to solve this problem. Custom destruction and repair heuristics and an efficient feasibility check for moves have been designed and evaluated on modified benchmarks for the VRP with time windows.

[1]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .

[2]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[3]  Teodor Gabriel Crainic,et al.  Models for Evaluating and Planning City Logistics Systems , 2009, Transp. Sci..

[4]  Alexandre Salles da Cunha,et al.  Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem , 2013, Optim. Lett..

[5]  Simona Mancini,et al.  Multi-echelon distribution systems in city logistics , 2013 .

[6]  Daniele Vigo,et al.  An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows , 2014, Comput. Oper. Res..

[7]  Fabien Lehuédé,et al.  Optimization of a city logistics transportation system with mixed passengers and goods , 2017, EURO J. Transp. Logist..

[8]  Jesús González-Feliu,et al.  Vehicle routing problems for city logistics , 2017, EURO J. Transp. Logist..

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

[10]  T. Crainic,et al.  ADVANCED FREIGHT TRANSPORTATION SYSTEMS FOR CONGESTED URBAN AREAS , 2004 .

[11]  Michael Drexl,et al.  Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints , 2012, Transp. Sci..

[12]  Daniele Vigo,et al.  The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics , 2011, Transp. Sci..

[13]  Guido Perboli,et al.  New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem , 2010, Electron. Notes Discret. Math..

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

[15]  Fabien Lehuédé,et al.  The Dial-A-Ride Problem with Transfers , 2014, Comput. Oper. Res..

[16]  Teodor Gabriel Crainic,et al.  Two-Echelon Vehicle Routing Problem: A satellite location analysis , 2010 .

[17]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[18]  Teodor Gabriel Crainic,et al.  A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows , 2013, Eur. J. Oper. Res..

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

[20]  Teodor Gabriel Crainic,et al.  Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem , 2011, EvoCOP.

[21]  Maria Grazia Speranza,et al.  A survey on two-echelon routing problems , 2015, Comput. Oper. Res..

[22]  Fabien Lehuédé,et al.  Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers , 2013, Oper. Res. Lett..

[23]  Simon Spoorendonk,et al.  A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem , 2013, Transp. Sci..

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

[25]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[26]  Christian Prins,et al.  Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking , 2012, Eur. J. Oper. Res..

[27]  Zhi-Yu Xu,et al.  A Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City Logistics , 2014 .

[28]  Teodor Gabriel Crainic,et al.  Clustering-based heuristics for the two-echelon vehicle routing problem , 2008 .

[29]  Jonathan F. Bard,et al.  A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment , 2012, Comput. Oper. Res..

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

[31]  R. Tadei,et al.  The two-echelon capacitated vehicle routing problem , 2008 .

[32]  T. Crainic,et al.  GRASP with Path Relinking for the Two-Echelon Vehicle Routing Problem , 2013 .

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

[34]  Alexandre Salles da Cunha,et al.  A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem , 2015, Transp. Sci..

[35]  Thomas Hahn,et al.  Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints , 2015, Eur. J. Oper. Res..

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

[37]  Roberto Roberti,et al.  Exact algorithms for different classes of vehicle routing problems , 2013, 4OR.

[38]  Thibaut Vidal,et al.  A large neighbourhood based heuristic for two-echelon routing problems , 2015, Comput. Oper. Res..