Vehicle routing and scheduling with dynamic travel times

Authors:
Jean-Yves Potvin;Ying Xu;Ilham Benyahia
Affiliations:
Centre de recherche sur les transports, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Qué., Canada H3C 3J7 and Département d'informatique et de rec ...;Centre de recherche sur les transports, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Qué., Canada H3C 3J7 and Département d'informatique et de rec ...;Département d'informatique et d'ingénierie, Université du Québec en Outaouais, C.P. 1250, succursale B, Hull, Qué., Canada J8X 3X7
Venue:
Computers and Operations Research
Year:
2006

Citing 1
Cited 8

Time-Varying Travel Times in Vehicle Routing

Transportation Science

DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic

Journal of Heuristics
Online vehicle routing and scheduling with dynamic travel times

Computers and Operations Research
Knowledge-based modeling for disruption management in urban distribution

Expert Systems with Applications: An International Journal
A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows

Operations Research Letters
A Flexible and Adaptive Hyper-heuristic Approach for (Dynamic) Capacitated Vehicle Routing Problems

Fundamenta Informaticae - Emergent Computing
A PAM approach to handling disruptions in real-time vehicle routing problems

Decision Support Systems
Comparing Static and Dynamic Policies for Vehicle Routing Problems with Backhauling and Dynamic Customer Demands

International Journal of Applied Logistics
A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The field of dynamic vehicle routing and scheduling is growing at a fast pace nowadays, due to many potential applications in courier services, emergency services, truckload and less-than-truckload trucking, and many others. In this paper, a dynamic vehicle routing and scheduling problem with time windows is described where both real-time customer requests and dynamic travel times are considered. Different reactive dispatching strategies are defined and compared through the setting of a single ''tolerance'' parameter. The results show that some tolerance to deviations with the current planned solution usually leads to better solutions.