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.
Parallel Auction Algorithm for Bus Rescheduling
2008-01-01
19 pages
Article/Chapter (Book)
Electronic Resource
English
A new algorithm for train rescheduling using rescheduling pattern
IuD Bahn | 2006
|An algorithm for train rescheduling using rescheduling pattern description language R
British Library Conference Proceedings | 2006
|European Patent Office | 2022
|Research on Greedy Train Rescheduling Algorithm
British Library Conference Proceedings | 2009
|Train rescheduling algorithm which minimizes passengers' dissatisfaction
Tema Archive | 2005
|