<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>6143</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>2016-12-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimization of Handouts for Rolling Stock Rotations Visualization</title>
    <abstract language="eng">A railway operator creates (rolling stock) rotations in order to have a precise master plan for the&#13;
operation of a timetable by railway vehicles. A rotation is considered as a cycle that multiply&#13;
traverses a set of operational days while covering trips of the timetable. As it is well known,&#13;
the proper creation of rolling stock rotations by, e.g., optimization algorithms is challenging&#13;
and still a topical research subject. Nevertheless, we study a completely different but strongly&#13;
related question in this paper, i.e.: How to visualize a rotation? For this purpose, we introduce&#13;
a basic handout concept, which directly leads to the visualization, i.e., handout of a rotation. In&#13;
our industrial application at DB Fernverkehr AG, the handout is exactly as important as the&#13;
rotation itself. Moreover, it turns out that also other European railway operators use exactly the&#13;
same methodology (but not terminology). Since a rotation can have many handouts of different&#13;
quality, we show how to compute optimal ones through an integer program (IP) by standard&#13;
software. In addition, a construction as well as an improvement heuristic are presented. Our&#13;
computational results show that the heuristics are a very reliable standalone approach to quickly&#13;
find near-optimal and even optimal handouts. The efficiency of the heuristics is shown via a&#13;
computational comparison to the IP approach.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-61430</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Boris Grimm</author>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>ZR-16-73</number>
    </series>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="grimm">Grimm, Boris</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="ROTOR">ROTOR</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="reuther">Reuther, Markus</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/6143/ZR-16-73.pdf</file>
  </doc>
  <doc>
    <id>4860</id>
    <completedYear/>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2591</pageFirst>
    <pageLast>2605</pageLast>
    <pageNumber/>
    <edition/>
    <issue>18</issue>
    <volume>160</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Models for Fare Planning in Public Transport</title>
    <parentTitle language="eng">Discrete Applied Mathematics</parentTitle>
    <identifier type="doi">10.1016/j.dam.2012.02.027</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-10708</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Marika Karbstein</author>
    <author>Marc Pfetsch</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>7509</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>12:1</pageFirst>
    <pageLast>12:15</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>75</volume>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Graph- and Monoid-based Framework for Price-Sensitive Routing in Local Public Transportation Networks</title>
    <abstract language="eng">We present a novel framework to mathematically describe the fare systems of local public transit companies. The model allows the computation of a provably cheapest itinerary even if prices depend on a number of parameters and non-linear conditions. Our approach is based on a ticket graph model to represent tickets and their relation to each other. Transitions between tickets are modeled via transition functions over partially ordered monoids and a set of symbols representing special properties of fares (e.g. surcharges). Shortest path algorithms rely on the subpath optimality property. This property is usually lost when dealing with complicated fare systems. We restore it by relaxing domination rules for tickets depending on the structure of the ticket graph. An exemplary model for the fare system of Mitteldeutsche Verkehrsbetriebe (MDV) is provided. By integrating our framework in the multi-criteria RAPTOR algorithm we provide a price-sensitive algorithm for the earliest arrival problem and assess its performance on data obtained from MDV. We discuss three preprocessing techniques that improve run times enough to make the algorithm applicable for real-time queries.</abstract>
    <parentTitle language="eng">19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)</parentTitle>
    <identifier type="doi">10.4230/OASIcs.ATMOS.2019.12</identifier>
    <enrichment key="Series">OpenAccess Series in Informatics (OASIcs)</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Ricardo Euler</author>
    <submitter>Ricardo Euler</submitter>
    <author>Ralf Borndörfer</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="euler">Euler, Ricardo</collection>
    <collection role="projects" number="MOIN">MOIN</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
</export-example>
