A Lagrangian heuristic for the real-time vehicle rescheduling problem

Jing Quan Li, Pitu B. Mirchandani, Denis Borenstein

Research output: Contribution to journalArticle

59 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 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

Keywords

  • Lagrangian heuristic
  • Rescheduling
  • Schedule disruption
  • Vehicle scheduling

ASJC Scopus subject areas

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation

Fingerprint Dive into the research topics of 'A Lagrangian heuristic for the real-time vehicle rescheduling problem'. Together they form a unique fingerprint.

  • Cite this