A Lagrangian heuristic for the real-time vehicle rescheduling problem

Jing Quan Li; Pitu B. Mirchandani; Denis Borenstein

doi:10.1016/j.tre.2008.09.002

A Lagrangian heuristic for the real-time vehicle rescheduling problem

Jing Quan Li, Pitu B. Mirchandani, Denis Borenstein

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

80 Scopus citations

Abstract

When a public transit vehicle breaks down on a scheduled trip, one or more vehicles need to be rescheduled to serve that trip and other service trips originally scheduled for the disabled vehicle. In this paper, the vehicle rescheduling problem (VRSP) is investiaged to consider operating costs, schedule disruption costs, and trip cancellation costs. The VRSP is proven to be NP-hard, and a Lagrangian relaxation based insertion heuristic is developed. Extensive computational experiments on randomly generated problems are reported. The results show that the Lagrangian heuristic performs very well for solving the VRSP.

Original language	English (US)
Pages (from-to)	419-433
Number of pages	15
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	45
Issue number	3
DOIs	https://doi.org/10.1016/j.tre.2008.09.002
State	Published - May 2009
Externally published	Yes

Keywords

Lagrangian heuristic
Rescheduling
Schedule disruption
Vehicle scheduling

ASJC Scopus subject areas

Business and International Management
Civil and Structural Engineering
Transportation

Access to Document

10.1016/j.tre.2008.09.002

Cite this

@article{d066d32101b64f3a9fb7604fde452162,

title = "A Lagrangian heuristic for the real-time vehicle rescheduling problem",

abstract = "When a public transit vehicle breaks down on a scheduled trip, one or more vehicles need to be rescheduled to serve that trip and other service trips originally scheduled for the disabled vehicle. In this paper, the vehicle rescheduling problem (VRSP) is investiaged to consider operating costs, schedule disruption costs, and trip cancellation costs. The VRSP is proven to be NP-hard, and a Lagrangian relaxation based insertion heuristic is developed. Extensive computational experiments on randomly generated problems are reported. The results show that the Lagrangian heuristic performs very well for solving the VRSP.",

keywords = "Lagrangian heuristic, Rescheduling, Schedule disruption, Vehicle scheduling",

author = "Li, {Jing Quan} and Mirchandani, {Pitu B.} and Denis Borenstein",

year = "2009",

month = may,

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

language = "English (US)",

volume = "45",

pages = "419--433",

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

issn = "1366-5545",

publisher = "Elsevier Limited",

number = "3",

}

TY - JOUR

T1 - A Lagrangian heuristic for the real-time vehicle rescheduling problem

AU - Li, Jing Quan

AU - Mirchandani, Pitu B.

AU - Borenstein, Denis

PY - 2009/5

Y1 - 2009/5

N2 - When a public transit vehicle breaks down on a scheduled trip, one or more vehicles need to be rescheduled to serve that trip and other service trips originally scheduled for the disabled vehicle. In this paper, the vehicle rescheduling problem (VRSP) is investiaged to consider operating costs, schedule disruption costs, and trip cancellation costs. The VRSP is proven to be NP-hard, and a Lagrangian relaxation based insertion heuristic is developed. Extensive computational experiments on randomly generated problems are reported. The results show that the Lagrangian heuristic performs very well for solving the VRSP.

AB - When a public transit vehicle breaks down on a scheduled trip, one or more vehicles need to be rescheduled to serve that trip and other service trips originally scheduled for the disabled vehicle. In this paper, the vehicle rescheduling problem (VRSP) is investiaged to consider operating costs, schedule disruption costs, and trip cancellation costs. The VRSP is proven to be NP-hard, and a Lagrangian relaxation based insertion heuristic is developed. Extensive computational experiments on randomly generated problems are reported. The results show that the Lagrangian heuristic performs very well for solving the VRSP.

KW - Lagrangian heuristic

KW - Rescheduling

KW - Schedule disruption

KW - Vehicle scheduling

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

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

U2 - 10.1016/j.tre.2008.09.002

DO - 10.1016/j.tre.2008.09.002

M3 - Article

AN - SCOPUS:64149106197

SN - 1366-5545

VL - 45

SP - 419

EP - 433

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

IS - 3

ER -

A Lagrangian heuristic for the real-time vehicle rescheduling problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this