Project B5: Line planning and periodic timetabling in railway traffic
Duration: | March 2003 - May 2006 |
As by June 01, 2006, this project was merged with
the former MATHEON project B1
into the new MATHEON project B15 | |
Project head: | Prof. Dr. Rolf H. Möhring |
Technische Universität Berlin | |
Institut für Mathematik | |
Straße des 17. Juni 136 | |
10623 Berlin | |
Germany | |
Tel: +49 (0)30 - 314 24594 | |
email: moehring@math.tu-berlin.de | |
Researcher: | Christian Liebchen |
for address, see above | |
Tel: +49 (0)30 - 314 25791 | |
email: liebchen@math.tu-berlin.de | |
Support: | DFG Research Center "Mathematics for Key Technologies" (Matheon) |
Industrial Partners: | see below |
Quick Links: | Publications |
Industrial Partners | |
Media |
Project description.
Background.
Line planning and periodic time tabling are tasks that occur on the strategic level in the railway traffic planning process and are typically done "once" per year. Starting from a network of stations and tracks, line planning chooses a set of lines with their frequencies in order to serve passenger demand and to optimize a given objective (e.g. operational cost, direct connections) on the basis of origin-destination data. Based on the chosen set of lines, timetabling then constructs a periodic timetable, again subject to different objectives such as total passenger travel time or rolling stock. Although there are obvious dependencies among these tasks, they are currently handled only sequentially, and mostly manually without the use of optimization tools.
Expertise.
Our group has obtained expert knowledge (see [4]) in a project with ptv traffic mobility logistics, Karlsruhe, on constructing periodic timetables for public transportation systems (our code is integrated into the 2001 release of their planning tool VISUM).
Research program.
The long term goal of this project is to develop optimization methods and algorithms for simultaneous line planning and periodic time tabling. Several mathematical models have been proposed and investigated for both tasks, separately [2]. Line planning is typically done in the context of network design for minimum cost multicommodity flows [1], while periodic timetabling is modeled via periodic potential constraints in a graph representing temporal events in a train schedule and leads to the so-called Periodical Event Scheduling Problem (PESP) [6]. Both lead to large integer programming models that can currently only be solved approximately. No models are available that study their interdependence or even aim at solving them simultaneously.
Achievements.
We developed the concept of integral cycle bases of directed graphs and compared this with other subclasses of cycle bases. For a more detailed description, we refer to the project site Cycle Bases of (Directed) Graphs. Further, we proposed an integrated integer-linear model for periodic timetabling and aspects of line planning (CASPT 2004). Also, we draw a sharper picture of the complexity of the PESP (WEA 2005). Finally, the basic concept of the 2005 timetable of Berlin Underground has been computed by our group (HEUREKA '05). To the best of our knowledge this is the first timetable that has been computed with mathematical optimization techniques and finally got into daily operation.
Cooperation.
Within the center, the closest methodological connections exist with projects B1, B8, and B9. External cooperation takes place with Berliner Verkehrsbetriebe (BVG), ptv, DB, and the Dutch railway planning group around Leo Kroon (Rotterdam).
Relevant Literature (at Project Start).
Project Output.
-
CurrentFormer
- Theoretical Research Project
-
Matheon Preprints
- Preprint 16: C. Liebchen, Finding Short Integral Cycle Bases for Cyclic Timetabling (pdf)
- Preprint 17: C. Liebchen, Symmetry for Periodic Railway Timetables (pdf)
- Preprint 147: C. Liebchen and R.H. Möhring, The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond (pdf)
- Preprint 148: C. Liebchen, M. Proksch, and F.H. Wagner, Performance of Algorithms for Periodic Timetable Optimization (pdf)
- Preprint 222: C. Liebchen, A Cut-based Heuristic to Produce Almost Feasible Periodic Railway Timetables (pdf)
- Preprint 223: C. Liebchen, Romeo Rizzi, A Greedy Approach to Compute a Minimum Cycle Bases of a Directed Graph (pdf)
- Preprint 287: C. Liebchen, Romeo Rizzi, Classes of Cycle Bases (pdf)
See also publications of Christian Liebchen -
Newspaper articles
- Schneller umsteigen, Berliner Zeitung, November 09, 2005
- Ganz Indien fährt täglich in Berlin, Tagesspiegel, October 22, 2005
Other- Forschung aktuell, Deutschlandfunk, radio interview, December 09, 2005
- Diploma Students
- Thomas Gelzhäuser
- Daniel Schmidt, Linien- und Taktfahrplanung - ein integrierter Optimierungsansatz, 2005
- Maja Zinke, Fahrlagenplanung und -optimierung zur Erstellung von Taktfahrplänen für den Fernverkehr der Deutschen Bahn AG, 2004
- Stephan Haenelt, Taktfahrplanoptimierung mit unterschiedlichen Taktzeiten, 2004
- Jan Laube, Taktfahrplanoptimierung mit Constraint Programming, 2004