Work

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

Year: 2018

Type: article

Abstract: 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.

Source: DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

DOI: 10.4230/oasics.atmos.2018.16

Authors: Borndörfer, Ralf, Karbstein, Marika, Liebchen, Christian, Lindner, Niels

Institutions: Zuse Institute Berlin, Technical University of Applied Sciences Wildau, Technische Universität Berlin

Language: English

Topic: Transportation Planning and Optimization

Subfield: Transportation

Field: Social Sciences

Domain: Social Sciences

SDGs: Sustainable cities and communities, Industry, innovation and infrastructure

Open Access status: green

Funder: Einstein Stiftung Berlin