TY - GEN
T1 - Parallel auction algorithm for bus rescheduling
AU - Li, Jing Quan
AU - Mirchandani, Pitu B.
AU - Borenstein, Denis
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=53749093237&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=53749093237&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-73312-6_14
DO - 10.1007/978-3-540-73312-6_14
M3 - Conference contribution
AN - SCOPUS:53749093237
SN - 9783540733119
T3 - Lecture Notes in Economics and Mathematical Systems
SP - 281
EP - 299
BT - Computer-aided Systems in Public Transport
A2 - Hickman, Mark
A2 - Mirchandani, Pitu
A2 - VoB, Stefan
ER -