Preemptive depot returns for dynamic same-day delivery

In this paper, we explore same-day delivery routing and particularly how same-day delivery vehicles can better integrate dynamic requests into delivery routes by taking advantage of preemptive depot returns. A preemptive depot return occurs when a delivery vehicle returns to the depot before delivering all of the packages currently on-board the vehicle. In this paper, we assume that a vehicle serves requests in a particular delivery area. Beginning the day with some known deliveries, the vehicle seeks to serve the known requests as well as additional new requests that are received throughout the day. To serve the new requests, the vehicle must return to the depot to pick up the packages for delivery. In contrast to previous work on same-day delivery routing, in this paper, we allow the vehicle to return to the depot before serving all loaded packages. To solve the problem, we couple an approximation of the value of choosing any particular subset of requests for delivery with a routing heuristic. Our approximation procedure is based on approximate dynamic programming and allows us to capture both the current value of a subset selection decision and its impact on future rewards. Using extensive computational tests, we demonstrate the value of preemptive depot returns and the value of the proposed approximation scheme in supporting preemptive returns. We also identify characteristics of instances for which preemptive depot returns are most likely to offer improvement.

[1]  Dirk C. Mattfeld,et al.  Offline-Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests , 2019, Transp. Sci..

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

[3]  Kamlesh Mathur,et al.  Stochastic Vehicle Routing Problem with Restocking , 2000, Transp. Sci..

[4]  J Figueira,et al.  Stochastic Programming , 1998, J. Oper. Res. Soc..

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

[6]  Jan Fabian Ehmke,et al.  Customer acceptance mechanisms for home deliveries in metropolitan areas , 2014, Eur. J. Oper. Res..

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

[8]  Barrett W. Thomas,et al.  A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs , 2017, Eur. J. Oper. Res..

[9]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[10]  Dirk C. Mattfeld,et al.  Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests , 2017, Transp. Sci..

[11]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[12]  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..

[13]  Alejandro Toriello,et al.  The One-Dimensional Dynamic Dispatch Waves Problem , 2016, Transp. Sci..

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

[15]  Nicola Secomandi,et al.  Analysis of a Rollout Approach to Sequencing Problems with Stochastic Routing Applications , 2003, J. Heuristics.

[16]  Jan Fabian Ehmke,et al.  Ensuring service levels in routing problems with time windows and stochastic travel times , 2015, Eur. J. Oper. Res..

[17]  Barrett W. Thomas,et al.  The Same-Day Delivery Problem for Online Purchases , 2017, Transp. Sci..

[18]  Dimitris Bertsimas,et al.  Computational Approaches to Stochastic Vehicle Routing Problems , 1995, Transp. Sci..

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

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

[21]  Warren B. Powell,et al.  “Approximate dynamic programming: Solving the curses of dimensionality” by Warren B. Powell , 2007, Wiley Series in Probability and Statistics.

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

[23]  Michel Gendreau,et al.  A dynamic vehicle routing problem with multiple delivery routes , 2011, Annals of Operations Research.

[24]  Cristián E. Cortés,et al.  A Methodology Based on Evolutionary Algorithms to Solve a Dynamic Pickup and Delivery Problem Under a Hybrid Predictive Control Approach , 2015, Transp. Sci..

[25]  Barrett W. Thomas,et al.  Restocking-Based Rollout Policies for the Vehicle Routing Problem with Stochastic Demand and Duration Limits , 2016, Transp. Sci..

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