Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem

Highlights • Extensions to four metaheuristics to handle stochastic time-dependent travel speeds.• Using a state-of-the-art, network-consistent, time-dependent travel time layer.• A new scheduling algorithm for the dynamic DARP with time-dependent travel speeds.• Exploiting historical accident information is beneficial in certain conditions.

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

[2]  E Thompson Taniguchi,et al.  VEHICLE ROUTING AND SCHEDULING USING ITS , 1998 .

[3]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[4]  Byong-Hun Ahn,et al.  Vehicle-routeing with Time Windows and Time-varying Congestion , 1991 .

[5]  Richard F. Hartl,et al.  Variable neighborhood search for the dial-a-ride problem , 2010, Comput. Oper. Res..

[6]  M Linauer,et al.  TRAVEL TIME ESTIMATION BASED ON INCOMPLETE PROBE CAR INFORMATION , 2006 .

[7]  Will Maden,et al.  A Road TimetableTM to aid vehicle routing and scheduling , 2006, Comput. Oper. Res..

[8]  Antonio LaTorre,et al.  A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city , 2013, Expert Syst. Appl..

[9]  Martin W. P. Savelsbergh,et al.  Optimization for dynamic ride-sharing: A review , 2012, Eur. J. Oper. Res..

[10]  Bernhard Fleischmann,et al.  Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..

[11]  Liping Fu,et al.  Improving Paratransit Scheduling by Accounting for Dynamic and Stochastic Variations in Travel Time , 1999 .

[12]  Herbert Peremans,et al.  A network-consistent time-dependent travel time layer for routing optimization problems , 2013, Eur. J. Oper. Res..

[13]  Jean-François Cordeau,et al.  Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints , 2012, OR Spectr..

[14]  Gilbert Laporte,et al.  Combining multicriteria analysis and tabu search for dial-a-ride problems , 2013 .

[15]  Chengbin Chu,et al.  The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments , 2008, Eur. J. Oper. Res..

[16]  J M Sussman,et al.  SCHEDULING ALGORITHMS FOR A DIAL-A-BUS SYSTEM , 1971 .

[17]  Karl F. Doerner,et al.  Ambulance location and relocation problems with time-dependent travel times , 2010, Eur. J. Oper. Res..

[18]  P. Healy,et al.  A new extension of local search applied to the Dial-A-Ride Problem , 1995 .

[19]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[20]  John R. Hauser,et al.  ADVANCED DIAL-A-RIDE ALGORITHMS RESEARCH PROJECT , 1976 .

[21]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

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

[23]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[24]  Martin W. P. Savelsbergh,et al.  Efficient feasibility testing for dial-a-ride problems , 2002, Oper. Res. Lett..

[25]  Jean-Yves Potvin,et al.  Online vehicle routing and scheduling with dynamic travel times , 2011, Comput. Oper. Res..

[26]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

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

[28]  Liping Fu,et al.  Scheduling dial-a-ride paratransit under time-varying, stochastic congestion , 2002 .

[29]  F Weichenmeier,et al.  Evaluation of speed estimation by floating car data within the research project Dmotion , 2007 .

[30]  Jan Fabian Ehmke,et al.  Advanced routing for city logistics service providers based on time-dependent travel times , 2012, J. Comput. Sci..

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

[32]  D. J. Rosenkrantz,et al.  Approximate Algorithms for the Traveling Salesperson Problem , 1974, SWAT.

[33]  Guy Desaulniers,et al.  The Vehicle Routing Problem with Time Windows , 2014, Vehicle Routing.

[34]  Daniele Pretolani,et al.  Ranking paths in stochastic time-dependent networks , 2014, Eur. J. Oper. Res..

[35]  Jean-Yves Potvin,et al.  Vehicle routing and scheduling with dynamic travel times , 2006, Comput. Oper. Res..

[36]  Michel Gendreau,et al.  Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach , 2014, Eur. J. Oper. Res..

[37]  Bernhard Fleischmann,et al.  Dynamic Vehicle Routing Based on Online Traffic Information , 2004, Transp. Sci..

[38]  Verena Schmid,et al.  Hybrid column generation and large neighborhood search for the dial-a-ride problem , 2013, Comput. Oper. Res..

[39]  Tom Van Woensel,et al.  Vehicle routing problem with stochastic travel times including soft time windows and service costs , 2013, Comput. Oper. Res..

[40]  Richard W. Eglese,et al.  Vehicle routing and scheduling with time-varying data: A case study , 2010, J. Oper. Res. Soc..

[41]  Elias W. Hans,et al.  A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks , 2010 .

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