An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization

Abstract This paper presents the Full Truckload Pickup and Delivery Problem with Resource Synchronization (FT-PDP-RS). It consists of optimizing the transport of materials between sites, using a heterogeneous fleet of trucks, in the context of public works. Full truckload pickup and delivery requests have to be served within time windows. Trucks are synchronized on pickup or delivery locations based on unitary loading and unloading resources. We propose an Adaptive Large Neighborhood Search (ALNS) to solve this problem. Custom destroy and repair operators and an efficient feasibility insertion procedure have been designed to solve it. The method has been evaluated on real instances from the literature and on real case instances from a public works company. Computational experiments confirm the efficiency of the method.

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

[2]  Mikael Rönnqvist,et al.  Combined vehicle routing and scheduling with temporal precedence and synchronization constraints , 2008, Eur. J. Oper. Res..

[3]  Fabien Lehuédé,et al.  A multi-criteria large neighbourhood search for the transportation of disabled people , 2014, J. Oper. Res. Soc..

[4]  Erwin Pesch,et al.  Analysis, modeling and solution of the concrete delivery problem , 2009, Eur. J. Oper. Res..

[5]  Mikael Rönnqvist,et al.  A hybrid method based on linear programming and tabu search for routing of logging trucks , 2009, Comput. Oper. Res..

[6]  Duc-Cuong Dang,et al.  Heuristic solutions for the vehicle routing problem with time windows and synchronized visits , 2016, Optim. Lett..

[7]  Nathalie Bostel,et al.  A two-phase heuristic for full truckload routing and scheduling with split delivery and resource synchronization in public works , 2014, 2014 International Conference on Logistics Operations Management.

[8]  Richard F. Hartl,et al.  New savings based algorithms for time constrained pickup and delivery of full truckloads , 2003, Eur. J. Oper. Res..

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

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

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

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

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

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

[15]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[16]  Matthieu van der Heijden,et al.  Dynamic transport scheduling under multiple resource constraints , 2005, Eur. J. Oper. Res..

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

[18]  Saïd Salhi,et al.  A Tabu Search Heuristic for a Full-Load, Multi-Terminal, Vehicle Scheduling Problem with Backhauling and Time Windows , 2004, J. Math. Model. Algorithms.

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

[20]  Markus Brachner,et al.  Solution methods for combined scheduling and transportation problems , 2013 .

[21]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[22]  Patrick Hirsch,et al.  Log-Truck Scheduling with a Tabu Search Strategy , 2007, Metaheuristics.

[23]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[24]  Zhenyuan Liu,et al.  Integrated scheduling of ready-mixed concrete production and delivery , 2014 .

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

[26]  Marion Kee,et al.  Analysis , 2004, Machine Translation.

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

[28]  Gerrit K. Janssens,et al.  A local search heuristic for the pre- and end-haulage of intermodal container terminals , 2009, Comput. Oper. Res..

[29]  David E. Boyce,et al.  In Memoriam: C. Bartlett McGuire (19252006) and Christopher B. Winsten (19232005) , 2006 .

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

[31]  Frank Meisel,et al.  Workforce routing and scheduling for electricity network maintenance with downtime minimization , 2013, Eur. J. Oper. Res..

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

[33]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

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

[35]  Patrick Hirsch,et al.  Minimizing Empty Truck Loads in Round Timber Transport with Tabu Search Strategies , 2011, Int. J. Inf. Syst. Supply Chain Manag..

[36]  Michel Gendreau,et al.  Flow-based integer linear programs to solve the weekly log-truck scheduling problem , 2014, Ann. Oper. Res..

[37]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[38]  Xiao Liu,et al.  Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration , 2010, Comput. Oper. Res..

[39]  Michel Gendreau,et al.  An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization , 2016, Eur. J. Oper. Res..

[40]  Anastasia Rubasheuskaya.  Combined scheduling-transportation model. Veidekke Industri AS case study , 2012 .

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

[42]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

[43]  Martin W. P. Savelsbergh,et al.  A Hybrid Solution Approach for Ready-Mixed Concrete Delivery , 2009, Transp. Sci..

[44]  Mikael Rönnqvist,et al.  A near-exact method for solving the log-truck scheduling problem , 2004 .

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

[46]  Stefan Irnich,et al.  Vehicle Routing Problems with Inter-Tour Resource Constraints , 2008 .

[47]  Gilbert Laporte,et al.  Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows , 2004, J. Oper. Res. Soc..

[48]  Michel Gendreau,et al.  A heuristic to solve the synchronized log-truck scheduling problem , 2013, Comput. Oper. Res..

[49]  Michael Drexl.  A Generic Heuristic for Vehicle Routing Problems with Multiple Synchronization Constraints , 2014 .

[50]  Gilbert Laporte,et al.  Vehicle routing with full loads , 1985, Comput. Oper. Res..

[51]  Juan José Salazar González,et al.  Hybridization of very large neighborhood search for ready-mixed concrete delivery problems , 2010, Comput. Oper. Res..

[52]  Kamlesh Mathur,et al.  Vehicle Routing and Scheduling with Full Truckloads , 2003, Transp. Sci..

[53]  Bernardo Almada-Lobo,et al.  A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations , 2016, Eur. J. Oper. Res..

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