Variable neighborhood search for the time-dependent vehicle routing problem with soft time windows

Authors:
Stefanie Kritzinger;Fabien Tricoire;Karl F. Doerner;Richard F. Hartl
Affiliations:
Department of Business Adminstration, University of Vienna, Vienna, Austria;Department of Business Adminstration, University of Vienna, Vienna, Austria;Department of Business Adminstration, University of Vienna, Vienna, Austria;Department of Business Adminstration, University of Vienna, Vienna, Austria
Venue:
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Year:
2011

Citing 8
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Variable neighborhood search

Computers and Operations Research
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

INFORMS Journal on Computing
Time-Varying Travel Times in Vehicle Routing

Transportation Science
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

Journal of Heuristics
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows

Operations Research Letters
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a variable neighborhood search for time-dependent vehicle routing problems with time windows. Unlike the well-studied routing problems with constant travel times, in the time-dependent case the travel time depends on the time of the day. This assumption approaches reality, in particular for urban areas where travel times typically vary during the day, e.g., because of traffic congestion due to rush hours. An experimental evaluation for the vehicle routing problem with soft time windows with and without time-dependent travel times is performed and it is shown that taking time-dependent travel times into account provides substantial improvements of the considered objective function.