A Lagrangian heuristic for the real-time vehicle rescheduling problem

Jing Quan Li, Pitu Mirchandani, Denis Borenstein

Research output: Contribution to journalArticle

57 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)419-433
Number of pages15
JournalTransportation Research Part E: Logistics and Transportation Review
Volume45
Issue number3
DOIs
StatePublished - May 2009
Externally publishedYes

Fingerprint

heuristics
operating costs
costs
Operating costs
time
Rescheduling
Heuristics
Costs
experiment
Experiments
Cancellation
Breakdown
NP-hard
Schedule
Experiment
Lagrangian relaxation
Disruption
Public transit

Keywords

  • Lagrangian heuristic
  • Rescheduling
  • Schedule disruption
  • Vehicle scheduling

ASJC Scopus subject areas

  • Business and International Management
  • Management Science and Operations Research
  • Transportation

Cite this

A Lagrangian heuristic for the real-time vehicle rescheduling problem. / Li, Jing Quan; Mirchandani, Pitu; Borenstein, Denis.

In: Transportation Research Part E: Logistics and Transportation Review, Vol. 45, No. 3, 05.2009, p. 419-433.

Research output: Contribution to journalArticle

@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 Pitu Mirchandani and Denis Borenstein",
year = "2009",
month = "5",
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

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

VL - 45

SP - 419

EP - 433

JO - Transportation Research, Part E: Logistics and Transportation Review

JF - Transportation Research, Part E: Logistics and Transportation Review

SN - 1366-5545

IS - 3

ER -