Parallel Auction Algorithm for Bus Rescheduling

Jing-Quan Li (), Pitu B. Mirchandani () and Denis Borenstein ()
Additional contact information
Jing-Quan Li: University of Arizona
Pitu B. Mirchandani: University of Arizona
Denis Borenstein: Federal University of Rio Grande do Sul

A chapter in Computer-aided Systems in Public Transport, 2008, pp 281-299 from Springer

Abstract: 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.

Keywords: Breakdown Point; Partial Assignment; Delay Cost; Vehicle Schedule; Crew Schedule Problem (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-73312-6_14

Ordering information: This item can be ordered from
http://www.springer.com/9783540733126

DOI: 10.1007/978-3-540-73312-6_14

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().