<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1054</id>
    <completedYear>2018</completedYear>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>16:1</pageFirst>
    <pageLast>16:15</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH</publisherName>
    <publisherPlace>Wadern</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>1</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">18th Workshop on Algorithmic Approaches for Transportation  Modelling, Optimization, and Systems (ATMOS 2018)</parentTitle>
    <identifier type="isbn">978-3-95977-096-5</identifier>
    <identifier type="urn">urn:nbn:de:kobv:526-opus4-10549</identifier>
    <enrichment key="SourceTitle">Borndörfer, R., Karbstein, M., Liebchen, C., &amp; Lindner, N. (2018). A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable In Ralf Borndörfer and Sabine Storandt (Eds.), 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018). (pp. 16:1-16:14). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing. 10.4230/OASIcs.ATMOS.2018.16</enrichment>
    <enrichment key="DOI_VoR">https://doi.org/10.4230/OASIcs.ATMOS.2018.16</enrichment>
    <licence>Creative Commons - CC BY 3.0 - Namensnennung 3.0 Unported</licence>
    <author>Ralf Borndörfer</author>
    <author>Marika Karbstein</author>
    <author>Christian Liebchen</author>
    <author>Niels Lindner</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>periodic timetabling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>bipartite matching</value>
    </subject>
    <collection role="ddc" number="006">Spezielle Computerverfahren</collection>
    <collection role="ddc" number="388">Verkehr; Landverkehr</collection>
    <collection role="institutes" number="">Fachbereich Ingenieur- und Naturwissenschaften</collection>
    <collection role="open_access" number="">open_access</collection>
    <thesisPublisher>Technische Hochschule Wildau</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-th-wildau/files/1054/OASIcs-ATMOS-2018-16.pdf</file>
  </doc>
</export-example>
