Multi-itinerary optimization as cloud service

In this paper, we describe multi-itinerary optimization (MIO)---a novel Bing Maps service that automates the process of building itineraries for multiple agents while optimizing their routes to minimize travel time or distance. MIO can be used by organizations with a fleet of vehicles and drivers, mobile salesforce, or a team of personnel in the field, to maximize workforce efficiency. It supports a variety of constraints, such as service time windows, duration, priority, pickup and delivery dependencies, and vehicle capacity. MIO also considers traffic conditions between locations, resulting in algorithmic challenges at multiple levels (e.g., calculating time-dependent travel-time distance matrices at scale and scheduling services for multiple agents). To support an end-to-end cloud service with turnaround times of a few seconds, our algorithm design targets a sweet spot between accuracy and performance. Toward that end, we build a scalable approach based on the ALNS metaheuristic. Our experiments show that accounting for traffic significantly improves solution quality: MIO finds efficient routes that avoid late arrivals, whereas traffic-agnostic approaches result in a 15% increase in the combined travel time and the lateness of an arrival. Furthermore, our approach generates itineraries with substantially higher quality than a cutting-edge heuristic (LKH), with faster running times for large instances.

[1]  Alain Quilliot,et al.  Vehicle routing problems with road‐network information: State of the art , 2018, Networks.

[2]  Keld Helsgaun,et al.  An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems: Technical report , 2017 .

[3]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[4]  T. A. J. Nicholson,et al.  Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..

[5]  Robert Geisberger Engineering Time-dependent One-To-All Computation , 2010, ArXiv.

[6]  Tom Van Woensel,et al.  Vehicle routing problem with stochastic travel times including soft time windows and service costs , 2013, Comput. Oper. Res..

[7]  Natashia Boland,et al.  Computational Complexity of Time-Dependent Shortest Path Problems , 2019 .

[8]  B. C. Dean Shortest Paths in FIFO Time-Dependent Networks : Theory and Algorithms , 2004 .

[9]  Subhash Suri,et al.  On the Complexity of Time-Dependent Shortest Paths , 2011, Algorithmica.

[10]  Richard F. Hartl,et al.  Adaptive large neighborhood search for service technician routing and scheduling problems , 2012, J. Sched..

[11]  Douglas Moura Miranda,et al.  The vehicle routing problem with hard time windows and stochastic travel and service time , 2016, Expert Syst. Appl..

[12]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[13]  Luke Marshall,et al.  Practical Risk Modeling for the Stochastic Technician Routing and Scheduling Problem , 2020 .

[14]  Andrew V. Goldberg,et al.  A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks , 2011, SEA.

[15]  Christelle Guéret,et al.  A parallel matheuristic for the technician routing and scheduling problem , 2013, Optim. Lett..

[16]  Dorothea Wagner,et al.  Time-Dependent Route Planning , 2009, Encyclopedia of GIS.

[17]  Rolf H. Möhring,et al.  Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems , 2009, Robust and Online Large-Scale Optimization.