<?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>
</export-example>
