Skip to main content
SpringerLink
Log in

Periodic Timetable Optimization in Public Transport

  • Conference paper
Operations Research Proceedings 2006

Part of the book series: Operations Research Proceedings ((ORP,volume 2006))

Abstract

„The timetable is the essence of the service offered by any provider of public transport.“ (Jonothan Tyler, CASPT 2006)

This work has been supported by the DFG Research Center M{upATHEON} in Berlin.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Michael R. Bussieck, Thomas Winter, and Uwe Zimmermann. Discrete optimization in public rail transport. Mathematical Programming B, 79:415–444, 1997.

    Google Scholar 

  2. Ramesh Hariharan, Telikepalli Kavitha, and Kurt Mehlhorn. A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In Michele Bugliesi et al., editors, ICALP, volume 4051 of Lecture Notes in Computer Science, pages 250–261. Springer, 2006.

    Google Scholar 

  3. Reinhard Huschke. Schneller Umsteigen. Berliner Zeitung, 61(262):12, 2005. Wednesday, November 9, 2005, In German.

    Google Scholar 

  4. Christian Liebchen. Finding short integral cycle bases for cyclic timetabling. In Giuseppe Di Battista and Uri Zwick, editors, ESA, volume 2832 of Lecture Notes in Computer Science, pages 715–726. Springer, 2003.

    Google Scholar 

  5. Christian Liebchen. A cut-based heuristic to produce almost feasible periodic railway timetables. In Sotiris E. Nikoletseas, editor, WEA, volume 3503 of Lecture Notes in Computer Science, pages 354–366. Springer, 2005.

    Google Scholar 

  6. Christian Liebchen. Der Berliner U-Bahn Fahrplan 2005 — Realisierung eines mathematisch optimierten Angebotskonzeptes. In HEUREKA’ 05: Optimierung in Transport und Verkehr, Tagungsbericht, number 002/81. FGSV Verlag, 2005. In German.

    Google Scholar 

  7. Christian Liebchen. Fahrplanoptimierung im Personenverkehr—Muss es immer ITF sein? Eisenbahntechnische Rundschau, 54(11):689–702, 2005. In German.

    Google Scholar 

  8. Christian Liebchen. Periodic Timetable Optimization in Public Transport. dissertation.de, 2006. PhD thesis.

    Google Scholar 

  9. Thomas Lindner. Train Schedule Optimization in Public Rail Transport. Ph.D. thesis, Technische Universität Braunschweig, 2000.

    Google Scholar 

  10. Christian Liebchen and Rolf H. Möhring. A case study in periodic timetabling. Electr. Notes in Theoretical Computer Science, 66(6), 2002.

    Google Scholar 

  11. Christian Liebchen and Rolf H. Möhring. The modeling power of the periodic event scheduling problem: Railway timetables — and beyond. Preprint 020/2004, TU Berlin, Mathematical Institute, 2004. To appear in Springer LNCS Volume Algorithmic Methods for Railway Optimization.

    Google Scholar 

  12. Christian Liebchen, Mark Proksch, and Frank H. Wagner. Performance of algorithms for periodic timetable optimization. To appear in Springer LNEMS PProceedings of the Ninth International Workshop on Computer-Aided Scheduling of Public Transport (CASPT). To appear.

    Google Scholar 

  13. Christian Liebchen and Romeo Rizzi. Cycles bases of graphs. Technical Report 2005-018, TU Berlin, Mathematical Institute, 2005. accepted for publication in Discrete Applied Mathematics.

    Google Scholar 

  14. Karl Nachtigall. Periodic Network Optimization and Fixed Interval Timetables. Habilitation thesis, Universität Hildesheim, 1998.

    Google Scholar 

  15. Michiel A. Odijk. A constraint generation algorithm for the construction of periodic railway timetables. Transp. Res. B, 30(6):455–464, 1996.

    Article  Google Scholar 

  16. Leon W.P. Peeters. Cyclic Railway Timetable Optimization. Ph.D. thesis, Erasmus Universiteit Rotterdam, 2003.

    Google Scholar 

  17. Alexander Schrijver and Adri G. Steenbeek. Dienstregelingontwikkeling voor Railned. Rapport CADANS 1.0, Centrum voor Wiskunde en Informatica, December 1994. In Dutch.

    Google Scholar 

  18. Paolo Serafini and Walter Ukovich. A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics, 2(4):550–581, 1989.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Kombinatorische Optimierung und Graphenalgorithmen, Technische Universität Berlin, Germany

    Christian Liebchen

Authors
  1. Christian Liebchen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe (TH), Kaiserstraße 12, 76131, Karlsruhe, Germany

    Karl-Heinz Waldmann  & Ulrike M. Stocker  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liebchen, C. (2007). Periodic Timetable Optimization in Public Transport. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_5

Download citation

Publish with us

Policies and ethics

Search

Navigation