<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>10184</id>
    <completedYear>2025</completedYear>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2:1</pageFirst>
    <pageLast>2:19</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>137</volume>
    <type>conferenceobject</type>
    <publisherName>Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik</publisherName>
    <publisherPlace>Dagstuhl, Germany</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2025-10-17</completedDate>
    <publishedDate>2025-10-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Geometric Approach to Integrated Periodic Timetabling and Passenger Routing</title>
    <abstract language="eng">We offer a geometric perspective on the problem of integrated periodic timetabling and passenger routing in public transport. Inside the space of periodic tensions, we single out those regions, where the same set of paths provides shortest passenger routes. This results in a polyhedral subdivision, which we combine with the known decomposition by polytropes. On each maximal region of the common refinement, the integrated problem is solvable in polynomial time. We transform these insights into a new geometry-driven primal heuristic, integrated tropical neighborhood search (ITNS). Computationally, we compare implementations of ITNS and the integrated (restricted) modulo network simplex algorithm on the TimPassLib benchmark set, and contribute better solutions in terms of total travel time for all but one of the twenty-five instances for which a proven optimal solution is not yet known.</abstract>
    <parentTitle language="eng">25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)</parentTitle>
    <identifier type="doi">10.4230/OASIcs.ATMOS.2025.2</identifier>
    <identifier type="isbn">978-3-95977-404-8</identifier>
    <identifier type="issn">2190-6807</identifier>
    <identifier type="urn">urn:nbn:de:0030-drops-247580</identifier>
    <enrichment key="ConferencePlace">Warsaw, Poland</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">2025-08-04</enrichment>
    <enrichment key="Series">Open Access Series in Informatics (OASIcs)</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Fabian Löbel</author>
    <editor>Jonas Sauer</editor>
    <submitter>Fabian Löbel</submitter>
    <author>Niels Lindner</author>
    <editor>Marie Schmidt</editor>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Periodic Timetabling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Passenger Routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Polyhedral Complexes</value>
    </subject>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fabian.loebel">Löbel, Fabian</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="lindner">Lindner, Niels</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <collection role="projects" number="MODAL-MobilityLab">MODAL-MobilityLab</collection>
    <collection role="projects" number="Mathplus-PaA3">Mathplus-PaA3</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>7386</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2019-07-05</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Restricted Modulo Network Simplex Method for Integrated Periodic Timetabling and Passenger Routing</title>
    <abstract language="eng">The Periodic Event Scheduling Problem is a well-studied NP-hard problem with applications in public transportation to find good periodic timetables. Among the most powerful heuristics to solve the periodic timetabling problem is the modulo network simplex method. In this paper, we consider the more difficult version with integrated passenger routing and propose a refined integrated variant to solve this problem on real-world-based instances.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-73868</identifier>
    <identifier type="doi">https://doi.org/https://doi.org/10.1007/978-3-030-48439-2_92</identifier>
    <author>Fabian Löbel</author>
    <submitter>Niels Lindner</submitter>
    <author>Niels Lindner</author>
    <author>Ralf Borndörfer</author>
    <series>
      <title>ZIB-Report</title>
      <number>19-36</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Periodic Event Scheduling Problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Periodic Timetabling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Integrated Passenger Routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Shortest Routes in Public Transport</value>
    </subject>
    <collection role="ccs" number="J.">Computer Applications</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="fabian.loebel">Löbel, Fabian</collection>
    <collection role="persons" number="lindner">Lindner, Niels</collection>
    <collection role="projects" number="ECMath-MI7">ECMath-MI7</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/7386/paper_OR19.pdf</file>
  </doc>
</export-example>
