Recovery management for a dial-a-ride system with real-time disruptions

Abstract The problem considered in this work stems from a non-profit organization in charge of door-to-door passenger transportation for medical appointments. Patients are picked up at home by a driver and are then dropped at their appointment location. They may also be driven back home at the end of their appointment. Some patients have specific requirements, e.g., they may require an accompanying person or a wheelchair. Planning such activities gives rise to a so-called dial-a-ride problem. In the present work, it is assumed that the requests assigned to the drivers have been selected, and the transportation plan has been established for the next day. However, in practice, appointment durations may vary due to unforeseen circumstances, and some transportation requests may be modified, delayed or canceled during the day. The aim of this work is to propose a reactive algorithm which can adapt the initial plan in order to manage the disruptions and to take care of as many patients as possible in real-time. The plan should be modified quickly when a perturbation is observed, without resorting to major changes which may confuse the drivers and the patients. Several recourse procedures are defined for this purpose. They allow the dispatcher to temporarily delete a request, to insert a previously deleted request, or to permanently cancel a request. Simulation techniques are used to test the approach on randomly generated scenarios. Several key performance indicators are introduced in order to measure the impact of the disruptions and the quality of the solutions.

[1]  Richard F. Hartl,et al.  Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports , 2011, Comput. Oper. Res..

[2]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[3]  Harilaos N. Psaraftis,et al.  Scheduling Large-Scale Advance-Request Dial-A-Ride Systems , 1986 .

[4]  W. Y. Szeto,et al.  A survey of dial-a-ride problems: Literature review and recent developments , 2018 .

[5]  John W. Tukey,et al.  Exploratory Data Analysis. , 1979 .

[6]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

[7]  Gilles Pesant,et al.  Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis , 2012, Transp. Sci..

[8]  M. Sol The general pickup and delivery problem , 2010 .

[9]  Gilbert Laporte,et al.  Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .

[10]  Christos A. Kontovas,et al.  Dynamic vehicle routing problems: Three decades and counting , 2016, Networks.

[11]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[12]  J. Christopher Beck,et al.  Modelling and Solving the Senior Transportation Problem , 2018, CPAIOR.

[13]  Walter Ukovich,et al.  A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem , 2006, Eur. J. Oper. Res..

[14]  Carl H. Häll,et al.  A modeling system for simulation of dial-a-ride services , 2012, Public Transp..

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

[16]  Rolf H. Möhring,et al.  The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications , 2009, Robust and Online Large-Scale Optimization.

[17]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

[18]  Gilbert Laporte,et al.  Waiting strategies for the dynamic pickup and delivery problem with time windows , 2004 .

[19]  Louis-Martin Rousseau,et al.  A Constraint Programming Approach for Solving Patient Transportation Problems , 2018, CP.

[20]  Gilbert Laporte,et al.  Quality of service in dial-a-ride operations , 2009, Comput. Ind. Eng..

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

[22]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

[23]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[24]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[25]  Kris Braekers,et al.  Typology and literature review for dial-a-ride problems , 2017, Ann. Oper. Res..

[26]  Gilles Pesant,et al.  Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming , 2011, Transp. Sci..