Anticipatory Vehicle Routing for Same-Day Pick-up and Delivery using Historical Data Clustering

In this paper we address the problem of same-day pick-up and delivery where a set of tasks are known a priori and a set of tasks are revealed during operation. The vehicle routes are precomputed based on the known and predicted requests and adjusted online as new requests are revealed. We propose a novel anticipatory insertion method which incorporates a set of predicted requests to beneficially adjust the routes of a fleet of vehicles in real-time. Requests are predicted based on historical data, which is clustered in advance. We exploit inherent patterns of the demand, which are captured by historical data and include them in a dynamic vehicle routing solver based on heuristics and adaptive large neighborhood search. The proposed method is evaluated using numerical simulations on a variety of real-world problems with up to 1655 requests per day. Their degree of dynamism ranges from 0.70 to 0.93. These instances represent dynamic multi-depot pickup and delivery problems with time windows. The method has shown to require less driven kilometers than comparable methods.

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

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

[3]  Roberto Musmanno,et al.  An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[4]  Paul Shaw,et al.  A new local search algorithm providing high quality solutions to vehicle routing problems , 1997 .

[5]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[6]  Bruce L. Golden,et al.  A library of local search heuristics for the vehicle routing problem , 2010, Math. Program. Comput..

[7]  D. Defays,et al.  An Efficient Algorithm for a Complete Link Method , 1977, Comput. J..

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

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

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

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

[12]  Jelmer van Lochem.  Improving Dynamic Route Optimisation by making use of Historical Data , 2019 .

[13]  Andrew Lim,et al.  A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.

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

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

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

[17]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

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