A cut-based heuristic to produce almost feasible periodic railway timetables

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 354-366

  Liebchen, Christian ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; POLYNOMIALS; PROBLEM SOLVING; RAILROAD TRANSPORTATION; SCHEDULING; TRAFFIC CONTROL;

CUT-BASED HEURISTIC; PERIODIC EVENT SCHEDULING PROBLEMS (PESP); RAILWAY TIMETABLES; TRAFFIC LIGHT SCHEDULING;

HEURISTIC METHODS;

EID: 24944578448     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_31     Document Type: Conference Paper

References (19)

1. Arora, S., Karger, D., and Karpinski, M. (1995) Polynomial Time Approximation Schemes for Dense Instances of NP-hard Problems. Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 284-293, ACM Press, New York
2. CPLEX 8.1 (2004) http://www.ilog.com/products/cplex, ILOG SA, France.
3. Crescenzi, P. and Kann, V. (2005) A compendium of NP optimization problems, http://www.nada.kth.se/~viggo/problemlist/compendium.html
4. Daduna, J.R. and Voß, S. (1995) Practical Experiences in Schedule Synchronization. In Daduna, J.R. et al.: Computer-Aided Transit Scheduling - Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport, LNEMS 430, 39-55, Springer
5. Engelhardt-Funke, O. and Kolonko, M. (2004) Analysing stability and investments in railway networks using advanced evolutionary algorithms. International Transactions in Operational Research 11, 381-394
6. Goemans, M. and Williamson, D. (1994). 878-Approximation Algorithms for MAX CUT and MAX 2SAT. Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 422-431, ACM Press, New York
7. Hassin, R. (1996) A Flow Algorithm for Network Synchronization. Operations Research 44, 570-579
8. Liebchen, C. (2005) Der Berliner U-Bahn Fahrplan 2005: Realisierung eines mathematisch optimierten Angebotskonzepts. Tagungsbericht Heureka '05 Optimierung in Transport und Verkehr, FGSV Verlag, in German
9. Liebchen, C., Möhring, R.H. (2004) The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond. Preprint 020/2004, Mathematical Institute, TU Berlin, Germany
10. Liebchen, C., Proksch, M., and Wagner, F.H. (2004) Performance of Algorithms for Periodic Timetable Optimization. Preprint 021/2004, Mathematical Institute, TU Berlin, Germany
11. Lindner, T. (2000) Train Schedule Optimization in Public Rail Transport. Ph.D. Thesis, TU Braunschweig, Germany
12. Martin, A., Achterberg, T., and Koch, T. (2003) MIPLIB 2003, http://www.zib.de/miplib
13. Nachtigall, K. and Voget, S. (1996) A genetic algorithm approach to periodic railway synchronization. Computers and Operations Research 23, 453-463
14. Odijk, M. (1997) Railway Timetable Generation. Ph.D. Thesis, TU Delft, The Netherlands
15. Papadimitriou, C.H. and Yannakakis, M. (1991) Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences 43, 425-440
16. Peeters, L. (2003) Cyclic Railway Timetable Optimization. Ph.D. Thesis, Erasmus Universiteit Rotterdam, The Netherlands
17. Schrijver, A. and Steenbeek, A. (1993) Dienstregelingontwikkeling voor Nederlandse Spoorwegen N.V. - Rapport Fase 1. Report, CWI, The Netherlands, In Dutch
18. Serafini, P., Ukovich, W. (1989) A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics 2, 550-581
19. Vitanyi, P.M.B. (1981) How Well Can a Graph be n-Colored? Discrete Mathematics 34, 69-80