Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows

Stefanie Kritzinger; Fabien Tricoire; Karl Franz Dörner; Richard Hartl

doi:10.1007/978-3-642-25566-3_5

Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows

Stefanie Kritzinger, Fabien Tricoire, Karl Franz Dörner, Richard Hartl

Department of Accounting, Innovation and Strategy

Publications: Contribution to book › Contribution to proceedings

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.

Original language	English
Title of host publication	Learning and Intelligent Optimization
Subtitle of host publication	5th International Conference, 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
ISBN (Electronic)	978-3-642-25566-3
ISBN (Print)	978-3-642-25565-6
DOIs	https://doi.org/10.1007/978-3-642-25566-3_5
Publication status	Published - 2011

Publication series

Series	Lecture Notes in Computer Science
ISSN	0302-9743

Austrian Fields of Science 2012

502052 Business administration

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/978-3-642-25566-3_5

Cite this

Kritzinger, S., Tricoire, F., Dörner, K. F., & Hartl, R. (2011). Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows. In C. A. Coello-Coello (Ed.), Learning and Intelligent Optimization: 5th International Conference, LION 5, Rome, Italy, January 17-21, 2011 (pp. 61-75). Springer. https://doi.org/10.1007/978-3-642-25566-3_5

Kritzinger, Stefanie ; Tricoire, Fabien ; Dörner, Karl Franz et al. / Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows. Learning and Intelligent Optimization: 5th International Conference, LION 5, Rome, Italy, January 17-21, 2011. editor / Carlos A. Coello-Coello. Berlin, Heidelberg : Springer, 2011. pp. 61-75 (Lecture Notes in Computer Science).

@inproceedings{16357ac431df4ef2bfe0fc59504c51b8,

title = "Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows",

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.",

keywords = "CSP, BWL",

author = "Stefanie Kritzinger and Fabien Tricoire and D{\"o}rner, {Karl Franz} and Richard Hartl",

note = "Host publication data : Springer Verlag Berlind Heidelberg 2011",

year = "2011",

doi = "10.1007/978-3-642-25566-3_5",

language = "English",

isbn = "978-3-642-25565-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "61--75",

editor = "Coello-Coello, {Carlos A.}",

booktitle = "Learning and Intelligent Optimization",

}

Kritzinger, S, Tricoire, F, Dörner, KF & Hartl, R 2011, Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows. in CA Coello-Coello (ed.), Learning and Intelligent Optimization: 5th International Conference, LION 5, Rome, Italy, January 17-21, 2011. Springer, Berlin, Heidelberg, Lecture Notes in Computer Science, pp. 61-75. https://doi.org/10.1007/978-3-642-25566-3_5

Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows. / Kritzinger, Stefanie; Tricoire, Fabien; Dörner, Karl Franz et al.
Learning and Intelligent Optimization: 5th International Conference, LION 5, Rome, Italy, January 17-21, 2011. ed. / Carlos A. Coello-Coello. Berlin, Heidelberg: Springer, 2011. p. 61-75 (Lecture Notes in Computer Science).

Publications: Contribution to book › Contribution to proceedings

TY - GEN

T1 - Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows

AU - Kritzinger, Stefanie

AU - Tricoire, Fabien

AU - Dörner, Karl Franz

AU - Hartl, Richard

N1 - Host publication data : Springer Verlag Berlind Heidelberg 2011

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - CSP

KW - BWL

U2 - 10.1007/978-3-642-25566-3_5

DO - 10.1007/978-3-642-25566-3_5

M3 - Contribution to proceedings

SN - 978-3-642-25565-6

T3 - Lecture Notes in Computer Science

SP - 61

EP - 75

BT - Learning and Intelligent Optimization

A2 - Coello-Coello, Carlos A.

PB - Springer

CY - Berlin, Heidelberg

ER -

Kritzinger S, Tricoire F, Dörner KF , Hartl R. Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows. In Coello-Coello CA, editor, Learning and Intelligent Optimization: 5th International Conference, LION 5, Rome, Italy, January 17-21, 2011. Berlin, Heidelberg: Springer. 2011. p. 61-75. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-25566-3_5

Variable Neighborhood Search for the Vehicle Routing Problem with Time Dependent Travel Times and soft Time Windows

Abstract

Publication series

Austrian Fields of Science 2012

UN SDGs

Access to Document

Fingerprint

Cite this