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 branch-price-and-cut algorithm for the time-dependent multiple truck–drone routing problem
Time-varying traffic conditions are crucial features of urban logistics. Overlooking these conditions will pose a high coordination risk for drone-assisted routing problems. In this paper, a time-dependent multiple truck–drone routing problem (TD-MTDRP), which captures the time-varying traffic conditions as time-dependent …