In late 2015 three of the co-authors of this paper published the first review on time-dependent routing problems. Since then, there have been several important algorithmic developments in the field. These include travel time prediction methods, real-time re-optimization by operating directly on the road graph, efficient exploration of solution neighborhoods, dynamic discretization discovery and Machine Learning-inspired methods. The aim of this survey is to present such research lines, together with indications on their further developments.
A new branch-and-Benders-cut algorithm for the time-dependent vehicle routing problem
Daily traffic congestion poses significant challenges for companies operating in urban areas. By considering predicted travel times throughout the day, route planning systems can improve delivery schedules, thereby reducing costs associated with delays and congestion. Although the time-dependent vehicle routing …