The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 7 of 131
Back to Result List

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

Please always quote using this URN: urn:nbn:de:0297-zib-69688
  • 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.

Download full text files

Export metadata

Metadaten
Author:Ralf Borndörfer, Marika Karbstein, Christian Liebchen, Niels Lindner
Document Type:ZIB-Report
Tag:Bipartite matching; Periodic timetabling; Vehicle scheduling
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
CCS-Classification:J. Computer Applications
Date of first Publication:2018/07/30
Series (Serial Number):ZIB-Report (18-38)
ISSN:1438-0064
Published in:appeared in: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
DOI:https://doi.org/10.4230/OASIcs.ATMOS.2018.16