Performance of algorithms for periodic timetable optimization

Lecture Notes in Economics and Mathematical Systems

Volumn 600, Issue , 2008, Pages 151-180

  Liebchen, Christian ^a   Proksch, Mark ^b   Wagner, Frank H ^c  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b Intranetz GmbH   (Germany)

^c DEUTSCHE BAHN AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (25)

1. Barták, R. (1999). Constraint programming: A survey of solving technology. AIRONews journal IV, 4, 7-11.
2. Berger, F. (2002). Minimale Kreisbasen in Graphen. Technical report, Lecture on the annual meeting of the DMV, Halle.
3. Bixby, B. (2003). Personal communication. Rice University.
4. Bussieck, M. R., Winter, T., and Zimmermann, U. (1997). Discrete optimization in public rail transport. Mathematical Programming (Series B), 79, 415-444.
5. Deo, N., Prabhu, M., and Krishnamoorthy, M. S. (1982). Algorithms for generating fundamental cycles in a graph. ACM Transactions on Mathematical Software, 8, 26-42.
6. Deo, N., Kumar, N., and Parsons, J. (1995). Minimum-length fundamental-cycle set problem: A new heuristic and an SIMD implementation. Technical report CS-TR-95-04. University of Central Florida.
7. Emden-Weinert, T. and Proksch, M. (1999). Best practice simulated annealing for the airline crew scheduling problem. Journal of Heuristics, 5, 419-436.
8. Horton, J. D. (1987). A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal on Computing, 16, 358-366.
9. ILOG SA (2004). CPLEX 8.1. http://www.ilog.com/products/cplex.
10. Laube, J. (2004). Taktfahrplanoptimierung mit Constraint Programming, diploma thesis, in German.
11. Liebchen, C. (2003). Finding short integral cycle bases for cyclic timetabling. In G. D. Battista and U. Zwick, editors, Algorithms-ESA 2003, Lecture Notes in Computer Science 2832, pages 715-726. Springer.
12. Liebchen, C. and Möhring, R. H. (2003). Information on MIPLIB's timetabinstances. Technical report 049/2003, TU Berlin.
13. Liebchen, C. and Möhring, R. H. (2007). The modeling power of the periodic event scheduling problem: Railway timetables - and beyond. This volume.
14. Liebchen, C. and Peeters, L. (2002a). On cyclic timetabling and cycles in graphs. Technical report 761/2002, TU Berlin.
15. Liebchen, C. and Peeters, L. (2002b). Some practical aspects of periodic timetabling. In P. Chamoni, R. Leisten, A. Martin, J. Minnemann, and H. Stadtler, editors, Operations Research Proceedings 2001, pages 25-32. Springer, Berlin.
16. Lindner, T. (2000). Train Schedule Optimization in Public Transport. Ph.D. thesis, TU Braunschweig.
17. Mühlenbein, H. (1997). Genetic algorithms. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 137-171. John Wiley & Sons.
18. Nachtigall, K. (1994). A branch and cut approach for periodic network programming. Hildesheimer Informatik-Berichte 29.
19. Nachtigall, K. (1996). Cutting planes for a polyhedron associated with a periodic network. Technical report, DLR Interner Bericht 17.
20. Nachtigall, K. (1998). Periodic network optimization and fixed interval timetables, habilitation thesis.
21. Nachtigall, K. and Voget, S. (1996). A genetic algorithm approach to periodic railway synchronization. Computers & Operations Research, 23, 453-463.
22. Odijk, M. (1997). Railway Timetable Generation. Ph.D. thesis, TU Delft.
23. Proksch, M. (1997). Simulated Annealing und seine Anwendung auf das Crew-Scheduling-Problem, Diploma thesis, in German.
24. Schrijver, A. and Steenbeek, A. (1993). Dienstregelingontwikkeling voor Neder-landse Spoorwegen N.V. Rapport Fase 1, in Dutch. Technical report, Centrum voor Wiskunde en Informatica.
25. Serafini, P. and Ukovich, W. (1989). A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics, 2, 550-581.