Dynamic pickup and delivery problems

In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup and delivery problems, in which objects or people have to be collected and delivered in real-time. It discusses some general issues as well as solution strategies.

[1]  Michel Gendreau,et al.  Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries , 2006 .

[2]  Gilbert Laporte,et al.  Dynamic transportation of patients in hospitals , 2010, OR Spectr..

[3]  Sven Oliver Krumke,et al.  The Online Dial-a-Ride Problem under Reasonable Load , 2000, CIAC.

[4]  Martijn Mes,et al.  Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems , 2007, Eur. J. Oper. Res..

[5]  Russell Bent,et al.  Online stochastic combinatorial optimization , 2006 .

[6]  Hani S. Mahmassani,et al.  On-Line Algorithms for Truck Fleet Assignment and Scheduling Under Real-Time Information , 1999 .

[7]  Gilbert Laporte,et al.  Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows , 2008, INFOR Inf. Syst. Oper. Res..

[8]  Devavrat Shah,et al.  Fundamental Performance Limits for Multi-Stage Vehicle Routing Problems , 2007 .

[9]  Jean-Charles Billaut,et al.  A tabu search heuristic for the dynamic transportation of patients between care units , 2011, Eur. J. Oper. Res..

[10]  Gilbert Laporte,et al.  Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..

[11]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[12]  Warren B. Powell,et al.  THE DYNAMIC VEHICLE ALLOCATION PROBLEM WITH UNCERTAIN DEMANDS , 1987 .

[13]  Barrett W. Thomas.  Waiting Strategies for Anticipating Service Requests from Known Customer Locations , 2007, Transp. Sci..

[14]  Warren B. Powell,et al.  Dynamic Models for Freight Transportation , 2007 .

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

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

[17]  Gianpaolo Ghiani,et al.  Anticipatory algorithms for same-day courier dispatching , 2009 .

[18]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[19]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[20]  G. Laporte,et al.  Transportation Demand , 2019, Energy: Supply and Demand.

[21]  Sven Oliver Krumke,et al.  Online Dial-a-Ride Problems: Minimizing the Completion Time , 2000, STACS.

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

[23]  Jason D. Papastavrou,et al.  A stochastic and dynamic model for the single-vehicle pick-up and delivery problem , 1999, Eur. J. Oper. Res..

[24]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

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

[26]  Lauri Häme,et al.  An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows , 2011, Eur. J. Oper. Res..

[27]  Jian Yang,et al.  Real-Time Multivehicle Truckload Pickup and Delivery Problems , 2004, Transp. Sci..

[28]  Patrick Jaillet,et al.  Online Vehicle Routing Problems: A Survey , 2008 .

[29]  Gilbert Laporte,et al.  Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic , 2006, Transp. Sci..

[30]  Kenneth S. Nickerson,et al.  Maximizing Profits for North American Van Lines' Truckload Division: A New Framework for Pricing and Operations , 1988 .

[31]  Gilbert Laporte,et al.  A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems , 2007, Networks.

[32]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[33]  Mark E. T. Horn,et al.  Fleet scheduling and dispatching for demand-responsive passenger services , 2002 .

[34]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[35]  Allan Larsen,et al.  The Dynamic Vehicle Routing Problem , 2000 .

[36]  Michel Gendreau,et al.  Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching , 2006, Transp. Sci..

[37]  Stefan Voß,et al.  Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem , 2004, Transp. Sci..

[38]  Jürgen Branke,et al.  Waiting Strategies for Dynamic Vehicle Routing , 2005, Transp. Sci..

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

[40]  Munther A. Dahleh,et al.  A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints , 2008, IEEE Transactions on Automatic Control.

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

[42]  Hani S. Mahmassani,et al.  Evaluation of Dynamic Fleet Management Systems: Simulation Framework , 1998 .

[43]  Cristián E. Cortés,et al.  Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering , 2008, Comput. Oper. Res..

[44]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[45]  Leen Stougie,et al.  On-line single-server dial-a-ride problems , 2001, Theor. Comput. Sci..

[46]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

[47]  Refael Hassin,et al.  The swapping problem , 1992, Networks.

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

[49]  Leen Stougie,et al.  On-Line Dial-a-Ride Problems under a Restricted Information Model , 2002, ESA.

[50]  Roberto Musmanno,et al.  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[51]  Oli B. G. Madsen,et al.  A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..

[52]  G. Don Taylor,et al.  Quantifying the value of advance load information in truckload trucking , 2006 .

[53]  Patrick Jaillet,et al.  Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios , 2006, Transp. Sci..

[54]  Leen Stougie,et al.  On-Line Dial-a-Ride Problems Under a Restricted Information Model , 2004, Algorithmica.