Category: <span>Cited by 1st review</span>

Investigating the use of metaheuristics for solving single vehicle routing problems with time-varying traversal costs

Metaheuristic algorithms, such as simulated annealing and tabu search, are popular solution techniques for vehicle routing problems (VRPs). These approaches rely on iterative improvements to a starting solution, involving slight alterations to the routes (ie, neighbourhood moves), moving a node …

Vehicle routing under time-dependent travel times: The impact of congestion avoidance

Daily traffic congestion forms a major problem for businesses such as logistic service providers and distribution firms. It causes late arrivals at customers and additional costs for hiring the truck drivers. Such costs caused by traffic congestion can be reduced …

The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics

An algorithm that can tackle time dependent vehicle routing problems with hard or soft time windows without any alteration in its structure is presented. Analytical and experimental results indicate that average computational time increases proportionally to the number of customers …

Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks

Real-time information can enable travelers to adapt to changing traffic conditions and make better routing decisions in uncertain networks. In this paper, a generic description of real-time online information is provided based on three schemes using partial online information and …

x
This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close