Modeling Dynamic Vehicle Routing Problems : A Literature Review and Framework

We present a literature review of and modeling framework for dynamic vehicle routing problems (DVRPs). Our review yields two key findings. First, DVRP papers often lack models of the underlying stochastic and dynamic problems that they study. Second, the overwhelming majority of DVRP solution methods employ route plans, a potential course of action to follow for future decision-making, e.g., a path through a set of realized service requests or a customer sequence coupled with various quantities required to implement heuristic decisionmaking methods. Essentially, the DVRP literature lacks models that connect real-world applications with solution methods. To bridge this gap, we introduce a route-based MDP model that extends the conventional MDP model for dynamic and stochastic optimization problems by redefining the conventional action space to operate on route plans. Under an easily satisfiable condition, we show route-based MDPs are equivalent to the conventional MDP model. We anticipate route-based MDPs will facilitate more scientific rigor in DVRP studies, provide researchers with a common modeling language, allow for better inquiry, and improve classification and description of solution methods. Using examples from the literature, we illustrate the value of connecting application and solution methodology via route-based MDPs.

[1]  Warren B. Powell,et al.  A unified framework for stochastic optimization , 2019, Eur. J. Oper. Res..

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

[3]  Richard F. Hartl,et al.  Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem , 2014, Eur. J. Oper. Res..

[4]  Christelle Guéret,et al.  A Fast Reoptimization Approach for the Dynamic Technician Routing and Scheduling Problem , 2018 .

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

[6]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[7]  Gilbert Laporte,et al.  Heuristics for dynamic and stochastic inventory-routing , 2014, Comput. Oper. Res..

[8]  Alejandro Toriello,et al.  The Dynamic Dispatch Waves Problem for same-day delivery , 2018, Eur. J. Oper. Res..

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

[10]  Marlin W. Ulmer,et al.  Approximate Dynamic Programming for Dynamic Vehicle Routing , 2017 .

[11]  Kjetil Fagerholt,et al.  Heuristics for dynamic and stochastic routing in industrial shipping , 2013, Comput. Oper. Res..

[12]  Nicola Secomandi,et al.  A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands , 2001, Oper. Res..

[13]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[14]  Russell Bent,et al.  Waiting and Relocation Strategies in Online Stochastic Vehicle Routing , 2007, IJCAI.

[15]  Shengxiang Yang,et al.  Ant algorithms with immigrants schemes for the dynamic vehicle routing problem , 2015, Inf. Sci..

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

[17]  Beno Benhabib,et al.  The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem , 2013 .

[18]  Warren B. Powell,et al.  Approximate Dynamic Programming - Solving the Curses of Dimensionality , 2007 .

[19]  Michel Gendreau,et al.  50th Anniversary Invited Article - Future Research Directions in Stochastic Vehicle Routing , 2016, Transp. Sci..

[20]  Shu Zhang,et al.  Dynamic Orienteering on a Network of Queues , 2018, Transp. Sci..

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

[22]  Michel Gendreau,et al.  A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods , 2013, Eur. J. Oper. Res..

[23]  Ferani E. Zulvia,et al.  Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time , 2016 .

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

[25]  Enrico Angelelli,et al.  The Stochastic and Dynamic Traveling Purchaser Problem , 2016, Transp. Sci..

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

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

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

[29]  Enrique Alba,et al.  Variable neighborhood search for the stochastic and dynamic vehicle routing problem , 2016, Ann. Oper. Res..

[30]  Gregorio Tirado,et al.  Determining departure times in dynamic and stochastic maritime routing and scheduling problems , 2017 .

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

[32]  Robert H. Storer,et al.  An approximate dynamic programming approach for the vehicle routing problem with stochastic demands , 2009, Eur. J. Oper. Res..

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

[34]  Matthew S. Maxwell,et al.  Approximate Dynamic Programming for Ambulance Redeployment , 2010, INFORMS J. Comput..

[35]  Dennis Huisman,et al.  A solution approach for dynamic vehicle and crew scheduling , 2004, Eur. J. Oper. Res..

[36]  Kan Wu,et al.  A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion , 2017, Comput. Ind. Eng..

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

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

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

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

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

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

[43]  Stefan Bock,et al.  Real-time control of express pickup and delivery processes in a dynamic environment , 2014 .

[44]  Niels A. H. Agatz,et al.  Strategies for Handling Temporal Uncertainty in Pickup and Delivery Problems with Time Windows , 2018, Transp. Sci..

[45]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

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

[47]  Maria Grazia Speranza,et al.  Short Term Strategies for a Dynamic Multi-Period Routing Problem , 2009 .

[48]  Barrett W. Thomas,et al.  Preemptive Depot Returns for a Dynamic Same-Day Delivery Problem , 2016 .

[49]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

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

[51]  Zhi-Long Chen,et al.  Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows , 2006, Transp. Sci..

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

[53]  Nicola Secomandi,et al.  Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands , 2009, Oper. Res..

[54]  Stefan Bock,et al.  Pro-active real-time routing in applications with multiple request patterns , 2016, Eur. J. Oper. Res..

[55]  Jano I. van Hemert,et al.  Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation , 2004, PPSN.

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

[57]  Jésica de Armas,et al.  Variable Neighborhood Search for a Dynamic Rich Vehicle Routing Problem with time windows , 2015, Comput. Ind. Eng..

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

[59]  Gregorio Tirado,et al.  Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search , 2017, Ann. Oper. Res..

[60]  A. Fabri,et al.  On dynamic pickup and delivery vehicle routing with several time windows and waiting times , 2006 .

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

[62]  Xin Wang,et al.  Rolling horizon planning for a dynamic collaborative routing problem with full-truckload pickup and delivery requests , 2015 .

[63]  Warren B. Powell,et al.  On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance , 2000, Transp. Sci..

[64]  M. Grazia Speranza,et al.  Trends in transportation and logistics , 2018, Eur. J. Oper. Res..

[65]  J. Papastavrou A stochastic and dynamic routing policy using branching processes with state dependent immigration , 1996 .

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

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

[68]  Barrett W. Thomas,et al.  Challenges and Advances in A Priori Routing , 2008 .

[69]  Stephan Meisel,et al.  Anticipatory Optimization for Dynamic Decision Making , 2011, Operations research / computer science interfaces series.

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

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

[72]  Alejandro Toriello,et al.  A Dynamic Traveling Salesman Problem with Stochastic Arc Costs , 2014, Oper. Res..

[73]  Nicola Secomandi,et al.  Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands , 2000, Comput. Oper. Res..

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

[75]  Martin W. P. Savelsbergh,et al.  50th Anniversary Invited Article - City Logistics: Challenges and Opportunities , 2016, Transp. Sci..

[76]  Leandros Tassiulas,et al.  Adaptive Routing on the Plane , 1996, Oper. Res..

[77]  Michaël Schyns,et al.  An ant colony system for responsive dynamic vehicle routing , 2015, Eur. J. Oper. Res..

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

[79]  Verena Schmid,et al.  Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming , 2012, Eur. J. Oper. Res..