License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2018.16
URN: urn:nbn:de:0030-drops-97214
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9721/
Go to the corresponding OASIcs Volume Portal

Borndörfer, Ralf ; Karbstein, Marika ; Liebchen, Christian ; Lindner, Niels

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

pdf-format:
OASIcs-ATMOS-2018-16.pdf (0.5 MB)

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.

BibTeX - Entry

@InProceedings{borndrfer_et_al:OASIcs:2018:9721,
  author =	{Ralf Bornd{\"o}rfer and Marika Karbstein and Christian Liebchen and Niels Lindner},
  title =	{{A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable}},
  booktitle =	{18th Workshop on Algorithmic Approaches for Transportation  Modelling, Optimization, and Systems (ATMOS 2018)},
  pages =	{16:1--16:15},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-096-5},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{65},
  editor =	{Ralf Bornd{\"o}rfer and Sabine Storandt},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9721},
  URN =		{urn:nbn:de:0030-drops-97214},
  doi =		{10.4230/OASIcs.ATMOS.2018.16},
  annote =	{Keywords: Vehicle Scheduling, Periodic Timetabling, Bipartite Matching}
}

Keywords: Vehicle Scheduling, Periodic Timetabling, Bipartite Matching
Collection: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
Issue Date: 2018
Date of publication: 28.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI