Parallel auction algorithm for bus rescheduling

Lecture Notes in Economics and Mathematical Systems

Volumn 600, Issue , 2008, Pages 281-299

  Li, Jing Quan ^a   Mirchandani, Pitu B ^a   Borenstein, Denis ^b  

^a University of Arizona   (United States)

^b FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 53749093237     PISSN: 00758442     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-73312-6_14     Document Type: Conference Paper

References (16)

1. Bertsekas, D. (1992). Auction algorithms for network flow problems: a tutorial introduction. Computational Optimization and Applications, 1, 7-66.
2. Bertsekas, D. and Castañon, D. (1991). Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Computing, 17, 707-732.
3. Bertsekas, D. and Eckstein, J. (1988). Dual coordinate step methods for linear network flow problems. Mathematical Programming, 42, 203-243.
4. Bodin, L. and Golden, B. (1981). Classification in vehicle routing and scheduling. Networks, 11, 97-108.
5. 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.
6. 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.
7. Ceder, A. (2002). Urban transit scheduling: framework, review and examples. Journal of Urban Planning and Development, 128, 225-244.
8. 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, ComputerAided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 430, pages 76-90. Springer, Berlin.
9. Dell'Amico, M. (1989). Una nuova procedura di assegnamento per il vehicle scheduling problem. Ricerca Operativa, 5, 13-21.
10. Dell'Amico, M., Fischetti, M., and Toth, P. (1993). Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Science, 39, 115-125.
11. Freling, R., Wagelmans, A., and Paixão, J. M. (2001). Models and algorithms for single-depot vehicle scheduling. Transportation Science, 35(165-180).
12. 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.
13. Huisman, D., Freling, R., and Wagelmans, A. (2004). A robust solution approach to the dynamic vehicle scheduling problem. Transportation Science, 38, 447-458.
14. Jonker, R. and Volgenant, T. (1986). Improving the Hungarian assignment algorithm. Operations Research Letters, 5, 171-176.
15. Paixão, J. M. and Branco, I. (1987). A quasi-assignment algorithm for bus scheduling. Networks, 17, 249-269.
16. Song, T. and Zhou, L. (1990). A new algorithm for the quasi-assignment problem. Annals of Operations Research, 24, 205-223.