A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable

  • We consider the following planning problem in public transportation: Given a periodic timetable, how many vehicles are required to operate it? In [9], 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.
Metadaten
Author:Ralf Borndörfer, Marika Karbstein, Christian Liebchen, Niels Lindner
Document Type:In Proceedings
Parent Title (English):18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
Volume:65
First Page:16:1
Last Page:16:15
Series:OpenAccess Series in Informatics (OASIcs)
Year of first publication:2018
Preprint:urn:nbn:de:0297-zib-69688
DOI:https://doi.org/10.4230/OASIcs.ATMOS.2018.16