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 timedependent 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.
time-dependent vehicle routing problems with time windows. Unlike the
well-studied routing problems with constant travel times, in the timedependent 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.
| Original language | English |
|---|---|
| Title of host publication | Learning and intelligent optimization |
| Subtitle of host publication | 5th international conference ; selected papers. LION 5, Rome, Italy, January 17 - 21, 2011 |
| Editors | Carlos A. Coello Coello |
| Place of Publication | Berlin, Heidelberg |
| Publisher | Springer |
| Pages | 61-75 |
| Number of pages | 15 |
| Volume | 6683 |
| ISBN (Print) | 978-3-642-25565-6 |
| Publication status | Published - 2011 |
Publication series
| Series | Lecture Notes in Computer Science |
|---|---|
| ISSN | 0302-9743 |
Austrian Fields of Science 2012
- 502017 Logistics