Parallel auction algorithm for bus rescheduling

Jing Quan Li, Pitu B. Mirchandani, Denis Borenstein

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

When a bus on a scheduled trip breaks down, one or more buses need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning buses in real-time to this cut trip, as well as to other scheduled trips with given starting and ending times, is referred to as the bus rescheduling problem (BRP). This paper considers modeling, algorithmic, and computational aspects of the single-depot BRP. The paper develops the sequential and parallel auction algorithm to solve the BRP. Computational results show that our approach solves the problem quickly.

Original languageEnglish (US)
Title of host publicationComputer-aided Systems in Public Transport
EditorsMark Hickman, Pitu Mirchandani, Stefan VoB
Pages281-299
Number of pages19
DOIs
StatePublished - Oct 17 2008
Externally publishedYes

Publication series

NameLecture Notes in Economics and Mathematical Systems
Volume600
ISSN (Print)0075-8442

ASJC Scopus subject areas

  • Mathematics (miscellaneous)
  • Economics, Econometrics and Finance (miscellaneous)

Fingerprint Dive into the research topics of 'Parallel auction algorithm for bus rescheduling'. Together they form a unique fingerprint.

Cite this