Computer-aided Systems in Public Transport pp 281-299 | Cite as
Parallel Auction Algorithm for Bus Rescheduling
Conference paper
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
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- Bertsekas, D. (1992). Auction algorithms for network flow problems: a tutorial introduction. Computational Optimization and Applications, 1, 7–66.Google Scholar
- Bertsekas, D. and Castañon, D. (1991). Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Computing, 17, 707–732.CrossRefGoogle Scholar
- Bertsekas, D. and Eckstein, J. (1988). Dual coordinate step methods for linear network flow problems. Mathematical Programming, 42, 203–243.CrossRefGoogle Scholar
- Bodin, L. and Golden, B. (1981). Classification in vehicle routing and scheduling. Networks, 11, 97–108.CrossRefGoogle Scholar
- Bokinge, U. and Hasselstrom, D. (1980). Improved vehicle scheduling in public transport through systematic changes in the time-table. European Journal of Operational Research, 5, 388–395.CrossRefGoogle Scholar
- Carpaneto, G., Dell’Amico, M., Fischetti, M., and Toth, P. (1989). A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks, 19, 531–548.CrossRefGoogle Scholar
- Ceder, A. (2002). Urban transit scheduling: framework, review and examples. Journal of Urban Planning and Development, 128, 225–244.CrossRefGoogle Scholar
- Daduna, J. R. and Paixão, J. M. P. (1995). Vehicle scheduling for public mass transit — an overview. In J. R. Daduna, I. Branco and J.M.P. Paixão, editors, Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 430, pages 76–90. Springer, Berlin.Google Scholar
- Dell’Amico, M. (1989). Una nuova procedura di assegnamento per il vehicle scheduling problem. Ricerca Operativa, 5, 13–21.Google Scholar
- Dell’Amico, M., Fischetti, M., and Toth, P. (1993). Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Science, 39, 115–125.CrossRefGoogle Scholar
- Freling, R., Wagelmans, A., and Paixão, J. M. (2001). Models and algorithms for single-depot vehicle scheduling. Transportation Science, 35(165–180).CrossRefGoogle Scholar
- Haase, K. and Friberg, C. (1999). An exact branch and cut algorithm for the vehicle and crew scheduling problem. In N. H.M. Wilson, editor, Computer-Aided Transit Scheduling, pages 63–80. Springer, Berlin.Google Scholar
- Huisman, D., Freling, R., and Wagelmans, A. (2004). A robust solution approach to the dynamic vehicle scheduling problem. Transportation Science, 38, 447–458.CrossRefGoogle Scholar
- Jonker, R. and Volgenant, T. (1986). Improving the Hungarian assignment algorithm. Operations Research Letters, 5, 171–176.CrossRefGoogle Scholar
- Paixão, J. M. and Branco, I. (1987). A quasi-assignment algorithm for bus scheduling. Networks, 17, 249–269.CrossRefGoogle Scholar
- Song, T. and Zhou, L. (1990). A new algorithm for the quasi-assignment problem. Annals of Operations Research, 24, 205–223.CrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2008