Strategies for Handling Temporal Uncertainty in Pickup and Delivery Problems with Time Windows

In many real-life routing problems there is more uncertainty with respect to the required timing of the service than with respect to the service locations. We focus on a pickup and delivery problem with time windows in which the pickup and drop-off locations of the service requests are fully known in advance, but the time at which these jobs will require service is only fully revealed during operations. We develop a sample-scenario routing strategy to accommodate a variety of potential time real- izations while designing and updating the routes. Our experiments on a breadth of instances show that advance time related information, if used intelligently, can yield benefits. Furthermore, we show that it is beneficial to tailor the consensus function that is used in the sample-scenario approach to the specifics of the problem setting. By doing so, our strategy performs well on instances with both short time windows and limited advance confirmation.

[1]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[2]  Rob A. Zuidwijk,et al.  How Much is Location Information Worth? A Competitive Analysis of the Online Traveling Salesman Problem with Two Disclosure Dates , 2008 .

[3]  Marius M. Solomon,et al.  The A Priori Dynamic Traveling Salesman Problem with Time Windows , 2004, Transp. Sci..

[4]  Barrett W. Thomas,et al.  Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits , 2013, Oper. Res..

[5]  Patrick Jaillet,et al.  Online traveling salesman problems with service flexibility , 2011, Networks.

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

[7]  P. C. Schuur,et al.  Look-ahead strategies for dynamic pickup and delivery problems , 2010, OR Spectr..

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

[9]  Moshe Dror,et al.  Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks , 1989, Transp. Sci..

[10]  W. H. Williams,et al.  A Simple Method for the Construction of Empirical Confidence Limits for Economic Forecasts , 1971 .

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

[12]  Mark Stefik,et al.  Planning with Constraints (MOLGEN: Part 1) , 1981, Artif. Intell..

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

[14]  Gianpaolo Ghiani,et al.  A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem , 2012, Transp. Sci..

[15]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

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

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

[18]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

[19]  Christelle Guéret,et al.  An event-driven optimization framework for dynamic vehicle routing , 2012, Decis. Support Syst..

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

[21]  Reijo Sulonen,et al.  Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives , 2012, Comput. Oper. Res..

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

[23]  Hani S. Mahmassani,et al.  Dynamic Truckload Routing, Scheduling, and Load Acceptance for Large Fleet Operation with Priority Demands , 2004 .

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

[25]  Chelsea C. White,et al.  Anticipatory Route Selection , 2004, Transp. Sci..

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

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

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

[29]  Cristián E. Cortés,et al.  Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem , 2009, Transp. Sci..