TY - CONF
A1 - BorndÃ¶rfer, Ralf
A1 - Karbstein, Marika
A1 - Liebchen, Christian
A1 - Lindner, Niels
T1 - A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable
T2 - 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
N2 - 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.
Y1 - 2018
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/7074
VL - 65
SP - 16:1
EP - 16:15
ER -