The real-time time-dependent vehicle routing problem

Huey Kuo Chen; Che Fu Hsueh; Mei Shiang Chang

doi:10.1016/j.tre.2005.01.003

The real-time time-dependent vehicle routing problem

Huey Kuo Chen, Che Fu Hsueh, Mei Shiang Chang

Department of Civil Engineering

Research output: Contribution to journal › Article › peer-review

151 Scopus citations

Abstract

In this article, the real-time time-dependent vehicle routing problem with time windows is formulated as a series of mixed integer programming models that account for real-time and time-dependent travel times, as well as for real-time demands in a unified framework. In addition to vehicles routes, departure times are treated as decision variables, with delayed departure permitted at each node serviced. A heuristic comprising route construction and route improvement is proposed within which critical nodes are defined to delineate the scope of the remaining problem along the time rolling horizon and an efficient technique for choosing optimal departure times is developed. Fifty-six numerical problems and a real application are provided for demonstration.

Original language	English
Pages (from-to)	383-408
Number of pages	26
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	42
Issue number	5
DOIs	https://doi.org/10.1016/j.tre.2005.01.003
State	Published - Sep 2006

Keywords

Real time
Time window constraints
Time-dependent travel time
Vehicle routing problem

Access to Document

10.1016/j.tre.2005.01.003

Cite this

@article{577f714d7b0a472bb86096d62e7f1a29,

title = "The real-time time-dependent vehicle routing problem",

abstract = "In this article, the real-time time-dependent vehicle routing problem with time windows is formulated as a series of mixed integer programming models that account for real-time and time-dependent travel times, as well as for real-time demands in a unified framework. In addition to vehicles routes, departure times are treated as decision variables, with delayed departure permitted at each node serviced. A heuristic comprising route construction and route improvement is proposed within which critical nodes are defined to delineate the scope of the remaining problem along the time rolling horizon and an efficient technique for choosing optimal departure times is developed. Fifty-six numerical problems and a real application are provided for demonstration.",

keywords = "Real time, Time window constraints, Time-dependent travel time, Vehicle routing problem",

author = "Chen, {Huey Kuo} and Hsueh, {Che Fu} and Chang, {Mei Shiang}",

note = "Funding Information: The authors would like to thank the National Science Council, Taiwan, for financially supporting part of this work. ",

year = "2006",

month = sep,

doi = "10.1016/j.tre.2005.01.003",

language = "???core.languages.en_GB???",

volume = "42",

pages = "383--408",

journal = "Transportation Research Part E: Logistics and Transportation Review",

issn = "1366-5545",

number = "5",

}

TY - JOUR

T1 - The real-time time-dependent vehicle routing problem

AU - Chen, Huey Kuo

AU - Hsueh, Che Fu

AU - Chang, Mei Shiang

N1 - Funding Information: The authors would like to thank the National Science Council, Taiwan, for financially supporting part of this work.

PY - 2006/9

Y1 - 2006/9

N2 - In this article, the real-time time-dependent vehicle routing problem with time windows is formulated as a series of mixed integer programming models that account for real-time and time-dependent travel times, as well as for real-time demands in a unified framework. In addition to vehicles routes, departure times are treated as decision variables, with delayed departure permitted at each node serviced. A heuristic comprising route construction and route improvement is proposed within which critical nodes are defined to delineate the scope of the remaining problem along the time rolling horizon and an efficient technique for choosing optimal departure times is developed. Fifty-six numerical problems and a real application are provided for demonstration.

AB - In this article, the real-time time-dependent vehicle routing problem with time windows is formulated as a series of mixed integer programming models that account for real-time and time-dependent travel times, as well as for real-time demands in a unified framework. In addition to vehicles routes, departure times are treated as decision variables, with delayed departure permitted at each node serviced. A heuristic comprising route construction and route improvement is proposed within which critical nodes are defined to delineate the scope of the remaining problem along the time rolling horizon and an efficient technique for choosing optimal departure times is developed. Fifty-six numerical problems and a real application are provided for demonstration.

KW - Real time

KW - Time window constraints

KW - Time-dependent travel time

KW - Vehicle routing problem

UR - http://www.scopus.com/inward/record.url?scp=33746545163&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2005.01.003

DO - 10.1016/j.tre.2005.01.003

M3 - 期刊論文

AN - SCOPUS:33746545163

SN - 1366-5545

VL - 42

SP - 383

EP - 408

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

IS - 5

ER -

The real-time time-dependent vehicle routing problem

Abstract

Keywords

Access to Document

Fingerprint

Cite this