Refine
Year of publication
- 2018 (1)
Document Type
- ZIB-Report (1)
Language
- English (1) (remove)
Has Fulltext
- yes (1) (remove)
Is part of the Bibliography
- no (1)
Keywords
- Bipartite matching (1)
- Periodic timetabling (1)
- Vehicle scheduling (1)
Institute
- Mathematical Optimization (1) (remove)
A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable
(2018)
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.