Solving routing problems with pairwise synchronization constraints

Pairwise route synchronization constraints are commonly encountered in the field of service technician routing and scheduling and in the area of mobile care. Pairwise route synchronization refers to constraints that require that two technicians or home care workers visit the same location at exactly the same time. We consider constraints of this type in the context of the well-known vehicle routing problem with time windows and a generic service technician routing and scheduling problem. Different approaches for dealing with the problem of pairwise route synchronization are compared and several ways of integrating a synchronization component into a metaheuristic algorithm tailored to the original problems are analyzed. When applied to benchmark instances from the literature, our algorithm matches almost all available optimal values and it produces several new best results for the remaining instances.

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

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

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

[4]  Jennifer Lynn Rich,et al.  A Home Health Care Routing and Scheduling Problem , 1998 .

[5]  Jacques Desrosiers,et al.  Fleet assignment and routing with schedule synchronization constraints , 1994, Eur. J. Oper. Res..

[6]  Cynthia Barnhart,et al.  Composite Variable Formulations for Express Shipment Service Network Design , 2002, Transp. Sci..

[7]  Andrew Lim,et al.  Manpower allocation with time windows and job teaming constraints , 2003 .

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

[9]  Cynthia Barnhart,et al.  UPS Optimizes Its Air Network , 2004, Interfaces.

[10]  Mikael Rönnqvist,et al.  Laps Care - an operational system for staff planning of home care , 2006, Eur. J. Oper. Res..

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

[12]  M. Rönnqvist,et al.  A Branch and Price Algorithm for the Combined Vehicle Routing and Scheduling Problem With Synchronization Constraints , 2007 .

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

[14]  André Langevin,et al.  Vehicle Routing for Urban Snow Plowing Operations , 2006, Transp. Sci..

[15]  Esben Kolind,et al.  The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach , 2009, Comput. Oper. Res..

[16]  Mikael Rönnqvist,et al.  Operations Research Improves Quality and Efficiency in Home Care , 2009, Interfaces.

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

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

[19]  Kjetil Fagerholt,et al.  Ship routing and scheduling with cargo coupling and synchronization constraints , 2011, Comput. Ind. Eng..

[20]  Jesper Larsen,et al.  The vehicle routing problem with time windows and temporal dependencies , 2011, Networks.

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

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

[23]  André Langevin,et al.  Synchronized arc routing for snow plowing operations , 2012, Comput. Oper. Res..

[24]  Fernando A. C. C. Fontes,et al.  Concave minimum cost network flow problems solved with a colony of ants , 2013, J. Heuristics.

[25]  David Pisinger,et al.  Synchronized dial-a-ride transportation of disabled passengers at airports , 2013, Eur. J. Oper. Res..

[26]  Richard F. Hartl,et al.  A heuristic solution method for node routing based solid waste collection problems , 2013, J. Heuristics.

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

[28]  Torbjörn Larsson,et al.  Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence , 2013, EURO J. Transp. Logist..

[29]  Michel Gendreau,et al.  The Synchronized Dynamic Vehicle Dispatching Problem , 2013, INFOR Inf. Syst. Oper. Res..

[30]  Christian Bierwirth,et al.  The home health care routing and scheduling problem with interdependent services , 2014, Health care management science.

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

[32]  Karl F. Doerner,et al.  The school bus routing and scheduling problem with transfers , 2015, Networks.

[33]  Marielle Christiansen,et al.  A branch-and-price method for a ship routing and scheduling problem with cargo coupling and synchronization constraints , 2015, EURO J. Transp. Logist..

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

[35]  Jörn Schönberger,et al.  Scheduling constraints in dial-a-ride problems with transfers: a metaheuristic approach incorporating a cross-route scheduling procedure with postponement opportunities , 2017, Public Transp..