© 2021 Elsevier LtdReducing distribution costs is one of the effective ways for logistics enterprises to improve their core competitiveness. Aiming at the multi-depot vehicle routing problem under the time-varying road network, this paper proposes an integer programming model with …
In this paper, we study the duration-minimizing time-dependent vehicle routing problem with time windows (DM-TDVRPTW), where time-dependent travel times represent different levels of road congestion throughout the day. The departure time from depot becomes an important decision to reduce the …
© 2000-2011 IEEE.Urban customized bus companies are increasingly motivated by design efforts that entail more efficient route scenarios to incorporate adaptation to temporal and spatial heterogeneity in travel demand. However, such motivations are usually hindered by ubiquitous arrival unpunctuality resulting …
© 2000-2011 IEEE.As an emerging urban public transport mode, responsive feeder transit system is flexible and can offer door-to-door services between new districts at margins with low urban transit coverage and trunk bus station. In this study, a joint optimization …
© 2021 IEEE.Constrained route planning (CRP) on transportation networks has been extensively studied because of its broad applications, such as route recommendation. However, the existing works on CRP neglect the time-dependent and multi-modal properties of transportation networks. This paper proposes …
© 2013 IEEE.Incorporating speed probability distribution to the computation of the route planning in car navigation systems guarantees more accurate and precise responses. In this paper, we propose a novel approach for selecting dynamically the number of samples used for …
In this paper we study the time-dependent profitable tour problem with resource constraints (TDPTPRC), a generalization of the profitable tour problem (PTP) which includes variable travel times to account for road congestion. In this problem, the set of customers to …
We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, for example, to avoid commuter traffic congestions. Existing techniques follow a two-phase approach: In a preprocessing step, …
Most time-dependent vehicle routing problems are based on a similar modeling paradigm: travel time information is represented by travel time functions between pairs of points of interest (e.g., depot or customers). Only a few papers investigate how these functions can …
Travel times inside cities often vary quite a lot during a day and significantly impact the duration of commercial delivery routes. Several authors have suggested time-dependent variants of the most commonly encountered vehicle routing problems. In these papers, however, time-dependency …