Dynamic Vehicle Routing Based on Online Traffic Information

Abstract

With the increasing availability of real-time information and communication systems in logistics, the need for appropriate planning algorithms, which make use of this technology, arises. Customers in transport markets increasingly expect quicker and more flexible fulfillment of their orders, especially in the electronic marketplace. This paper considers a dynamic routing system that dispatches a fleet of vehicles according to customer orders arriving at random during the planning period. Each customer order requires a transport from a pickup location to a delivery location in a given time window. The system disposes of online communication with all drivers and customers and, in addition, disposes of online information on travel times from a traffic management center. This paper presents a planning framework for this situation which, to our knowledge, has not yet been addressed in the literature. It then describes three routing procedures for event-based dispatching, which differ in the length of the planning horizon per event. We focus on the use of dynamic travel time information, which requires dynamic shortest path calculations. The procedures are tested and compared using real-life data of an urban traffic management center and a logistics service provider.