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.
Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
We analyze several time dependency issues for the selective traveling salesman problem with time-dependent profits. Specifically, we consider the case in which the profit collected at a vertex depends on the service time, understood as the time spent at this …
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks
We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results. First, we study basic operations on piecewise linear arrival time functions. In particular, we devise a faster …
A novel collaborative electric vehicle routing problem with multiple prioritized time windows and time-dependent hybrid recharging
© 2023 Elsevier LtdDue to global warming and environmental deterioration, the development of electric vehicles (EVs) is seen as a key measure to promote energy saving and emission reduction in logistics industries. However, EVs’ limited driving range and long recharging …
Bus routing fine-tuning for integrated network-based demand and bus bridging for a disrupted railway system
© 2023 Elsevier LtdUnanticipated commuter railway disruptions inevitably tend to result in passenger bunching and frustration with considerable delays. Bus bridging strategy is a timely response approach to operationally handle and ease these scheduling disturbance issues. Conventional strategies, in this …
Multi-attribute two-echelon location routing: Formulation and dynamic discretization discovery approach
© 2023 Elsevier B.V.We study the two-echelon location-routing system under tight synchronization constraints, in addition to several other interacting attributes. Prompted, in particular, by city-logistics applications, the system we address concerns a two-echelon distribution layout composed of a set of …
Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
© 2023 Elsevier LtdThis study attempts to solve a split pickup vehicle routing problem with time windows and time-dependent demand. This is a vehicle routing problem in which demand is generated at different constant rates for different customers, and vehicles …
Understanding route choice behaviors' impact on traffic throughput in a dynamic transportation network
© 2024 The AuthorsRoute planning is one of the most important and attractive topics in complex networks, geographical information science (GIS) and logistics. Travelers’ route choice behaviors may affect the actual throughput of a transportation network. This study aims to …
The multi-visit drone-assisted pickup and delivery problem with time windows
© 2023 Elsevier B.V.We consider a new combined truck–drone routing problem with time windows in the context of last-mile logistics. A fleet of trucks, each equipped with an identical drone, is scheduled to provide both pickup and delivery services to …
Solving the multi-compartment vehicle routing problem by an augmented Lagrangian relaxation method
© 2023In real-world routing applications such as waste collection or fuel distribution, multiple products that cannot be mixed should be jointly collected or delivered. Multi-compartment vehicles are applied with great flexibility in routing and assignment decisions for these real-world applications. …