eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2018-08-28
16:1
16:15
10.4230/OASIcs.ATMOS.2018.16
article
A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable
Borndörfer, Ralf
1
Karbstein, Marika
1
Liebchen, Christian
2
Lindner, Niels
1
Zuse Institute Berlin (ZIB), Takustr. 7, 14195 Berlin, Germany
Technical University of Applied Sciences Wildau, Hochschulring 1, 15745 Wildau, Germany
We consider the following planning problem in public transportation: Given a periodic timetable, how many vehicles are required to operate it?
In [Julius Paetzold et al., 2017], for this sequential approach, it is proposed to first expand the periodic timetable over time, and then answer the above question by solving a flow-based aperiodic optimization problem.
In this contribution we propose to keep the compact periodic representation of the timetable and simply solve a particular perfect matching problem. For practical networks, it is very much likely that the matching problem decomposes into several connected components. Our key observation is that there is no need to change any turnaround decision for the vehicles of a line during the day, as long as the timetable stays exactly the same.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol065-atmos2018/OASIcs.ATMOS.2018.16/OASIcs.ATMOS.2018.16.pdf
Vehicle Scheduling
Periodic Timetabling
Bipartite Matching