<?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>7429</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-08-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Three-Phase Heuristic for Cyclic Crew Rostering with Fairness Requirements</title>
    <abstract language="eng">In this paper, we consider the Cyclic Crew Rostering Problem with Fairness Requirements (CCRP-FR). In this problem, attractive cyclic rosters have to be constructed for groups of employees, considering multiple, a priori determined, fairness levels. The attractiveness follows from the structure of the rosters (e.g., sufficient rest times and variation in work), whereas fairness is based on the work allocation  among the different roster groups. We propose a three-phase heuristic for the CCRP-FR, which  combines the strength of column generation techniques with a large-scale neighborhood search algorithm.  The design of the heuristic assures that good solutions for all fairness levels are obtained quickly, and can still be further improved if additional running time is available. We evaluate the performance of the algorithm using real-world data from Netherlands Railways, and show that the heuristic finds close to optimal solutions for many of the considered instances. In particular, we show that the heuristic is able to quickly find major improvements upon the current sequential practice: For most instances, the heuristic is  able to increase the attractiveness  by at least 20% in just a few minutes.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-74297</identifier>
    <author>Thomas Breugem</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Ralf Borndörfer</author>
    <author>Thomas Schlechte</author>
    <author>Christof Schulz</author>
    <series>
      <title>ZIB-Report</title>
      <number>19-43</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Crew Planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Column Generation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Variable-Depth Neighborhood Search</value>
    </subject>
    <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="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="schulz">Schulz, Christof</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/7429/ZR-19-43.pdf</file>
  </doc>
  <doc>
    <id>7466</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-09-11</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Multi-Period Line Planning with Resource Transfers</title>
    <abstract language="eng">Urban transportation systems are subject to a high level of variation and fluctuation in demand over the day. When this variation and fluctuation are observed in both time and space, it is crucial to develop line plans that are responsive to demand. A multi-period line planning approach that considers a changing demand during the planning horizon is proposed. If such systems are also subject to limitations of resources, a dynamic transfer of resources from one line to another throughout the planning horizon should also be considered. A mathematical modelling framework is developed to solve the line planning problem with transfer of resources during a finite length planning horizon of multiple periods. We analyze whether or not multi-period solutions outperform single period solutions in terms of feasibility and relevant costs. The importance of demand variation on multi-period solutions is investigated. We evaluate the impact of resource transfer constraints on the effectiveness of solutions. We also study the effect of line type designs and question the choice of period lengths along with the problem parameters that are significant for and sensitive to the optimality of solutions.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-74662</identifier>
    <author>Guvenc Sahin</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Amin Ahmadi</author>
    <author>Ralf Borndörfer</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>19-51</number>
    </series>
    <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="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</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/7466/ZR-19-51.pdf</file>
  </doc>
  <doc>
    <id>7397</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2019-07-18</completedDate>
    <publishedDate>2019-07-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Re-optimizing ICE Rotations after a Tunnel Breakdown near Rastatt</title>
    <abstract language="eng">Planning    rolling    stock    movements    in    industrial    passenger    railway    applications    isa long-term process based on timetables which are also often valid for long periods of time. For these timetables and rotation plans, i.e., plans of railway vehicle movements are constructed as templates for these periods. During operation the rotation plans are affected by all kinds of unplanned events. An unusal example for that is the collapse of a tunnel ceiling near Rastatt in southern Germany due to construction works related to the renewal of the central station in Stuttgart. As a result the main railway connection between Stuttgart and Frankfurt am Main, located on top of the tunnel, had to be closed from August 12th to October 2nd 2017. This had a major impact on the railway network in southern Germany. Hence, all rotation plans and train schedules for both passenger and cargo traffic had to be revised. In this paper we focus on a case study for this situation and compute new rotation plans via mixed integer programming for  the  ICE  high  speed  fleet  of  DB  Fernverkehr  AG  one  of  the  largest  passenger  railway companies in Europe. In our approach we take care of some side constraints to ensure a smooth continuation of the rotation plans after the disruption has ended.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-73976</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings of the 8th International Conference on Railway Operations Modelling and Analysis - RailNorrköping 2019</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Boris Grimm</author>
    <submitter>Boris Grimm</submitter>
    <author>Ralf Borndörfer</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>19-02</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>case study</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>re-optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>railway rolling stock optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mixed integer programming</value>
    </subject>
    <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="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/7397/ZR-19-02.pdf</file>
  </doc>
  <doc>
    <id>7398</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>160</pageFirst>
    <pageLast>168</pageLast>
    <pageNumber/>
    <edition/>
    <issue>069</issue>
    <volume>Linköping Electronic Conference Proceedings</volume>
    <type>conferenceobject</type>
    <publisherName>Linköping University Electronic Press, Linköpings universitet</publisherName>
    <publisherPlace>Linköping, Sweden</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2019-09-13</completedDate>
    <publishedDate>2019-06-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Re-optimizing ICE Rotations after a Tunnel Breakdown near Rastatt</title>
    <abstract language="eng">Planning    rolling    stock    movements    in    industrial    passenger    railway    applications    isa long-term process based on timetables which are also often valid for long periods of time. For these timetables and rotation plans, i.e., plans of railway vehicle movements are constructed as templates for these periods. During operation the rotation plans are affected by all kinds of unplanned events. An unusal example for that is the collapse of a tunnel ceiling near Rastatt in southern Germany due to construction works related to the renewal of the central station in Stuttgart. As a result the main railway connection between Stuttgart and Frankfurt am Main, located on top of the tunnel, had to be closed from August 12th to October 2nd 2017. This had a major impact on the railway network in southern Germany. Hence, all rotation plans and train schedules for both passenger and cargo traffic had to be revised. In this paper we focus on a case study for this situation and compute new rotation plans via mixed integer programming for  the  ICE  high  speed  fleet  of  DB  Fernverkehr  AG  one  of  the  largest  passenger  railway companies in Europe. In our approach we take care of some side constraints to ensure a smooth continuation of the rotation plans after the disruption has ended.</abstract>
    <parentTitle language="eng">Proceedings of the 8th International Conference on Railway Operations Modelling and Analysis - RailNorrköping 2019</parentTitle>
    <identifier type="issn">1650-3686</identifier>
    <identifier type="isbn">978-91-7929-992-7</identifier>
    <identifier type="url">http://www.ep.liu.se/ecp/article.asp?issue=069&amp;article=011&amp;volume=</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="SubmissionStatus">epub ahead of print</enrichment>
    <enrichment key="AcceptedDate">2019-03-22</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-73976</enrichment>
    <enrichment key="FulltextUrl">http://www.ep.liu.se/ecp/069/011/ecp19069011.pdf</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Boris Grimm</submitter>
    <author>Boris Grimm</author>
    <author>Thomas Schlechte</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="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="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>7399</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>8</pageLast>
    <pageNumber/>
    <edition/>
    <issue>10</issue>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2019-03-16</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimization of handouts for rolling stock rotations</title>
    <abstract language="eng">A railway operator creates (rolling stock) rotations in order to have a precise master plan for the operation of a timetable by railway vehicles. A rotation is considered as a cycle that multiply traverses a set of operational days while covering trips of the timetable. As it is well known, the proper creation of rolling stock rotations by, e.g., optimization algorithms is challenging and still a topical research subject. Nevertheless, we study a completely different but strongly related question in this paper, i.e.: How to visualize a rotation? For this purpose, we introduce a basic handout concept, which directly leads to the visualization, i.e., handout of a rotation. In our industrial application at DB Fernverkehr AG, the handout is exactly as important as the rotation itself. Moreover, it turns out that also other European railway operators use exactly the same methodology (but not terminology). Since a rotation can have many handouts of different quality, we show how to compute optimal ones through an integer program (IP) by standard software. In addition, a construction as well as an improvement heuristic are presented. Our computational results show that the heuristics are a very reliable standalone approach to quickly find near-optimal and even optimal handouts. The efficiency of the heuristics is shown via a computational comparison to the IP approach.</abstract>
    <parentTitle language="eng">Journal of Rail Transport Planning &amp; Management</parentTitle>
    <identifier type="doi">10.1016/j.jrtpm.2019.02.001</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">2019-02-20</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-61430</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Boris Grimm</submitter>
    <author>Boris Grimm</author>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</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="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="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="reuther">Reuther, Markus</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>1405</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-09-22</completedDate>
    <publishedDate>2011-09-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Hypergraph Model for Railway Vehicle Rotation Planning</title>
    <abstract language="eng">We propose a model for the integrated optimization of vehicle&#13;
  rotations and vehicle compositions in long distance railway passenger&#13;
  transport. The main contribution of the paper is a hypergraph model&#13;
  that is able to handle the challenging technical requirements as&#13;
  well as very general stipulations with respect to the ``regularity''&#13;
  of a schedule. The hypergraph model directly generalizes network&#13;
  flow models, replacing arcs with hyperarcs. Although NP-hard in&#13;
  general, the model is computationally well-behaved in practice.  High&#13;
  quality solutions can be produced in reasonable time using high&#13;
  performance Integer Programming techniques, in particular, column&#13;
  generation and rapid branching. We show that, in this way,&#13;
  large-scale real world instances of our cooperation partner DB&#13;
  Fernverkehr can be solved.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">11-36</identifier>
    <identifier type="doi">/10.4230/OASIcs.ATMOS.2011.146</identifier>
    <identifier type="urn">urn:nbn:de:0030-drops-32746</identifier>
    <enrichment key="SourceTitle">Appeared in: 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Alberto Caprara and Spyros Kontogiannis (eds.) 2011, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, ISBN 978-3-939897-33-0, pp. 146-155, OpenAccess Series in Informatics (OASIcs), 20</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>11-36</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Rolling Stock Planning, Hypergraph Modeling, Integer Programming,    Column Generation, Rapid Branching</value>
    </subject>
    <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="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <collection role="projects" number="MATHEON-B22">MATHEON-B22</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/1405/ZR-11-36.pdf</file>
  </doc>
  <doc>
    <id>7550</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>2020-01-06</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Cut Separation Approach for the Rolling Stock Rotation Problem with Vehicle Maintenance</title>
    <abstract language="eng">For providing railway services the company’s railway rolling stock is one if not the most important ingredient. It decides about the number of passenger or cargo trips the company can offer, about the quality a passenger experiences the train ride&#13;
and it is often related to the image of the company itself. Thus, it is highly desired to&#13;
have the available rolling stock in the best shape possible. Moreover, in many countries, as Germany where our industrial partner DB Fernverkehr AG (DBF) is located, laws enforce regular vehicle inspections to ensure the safety of the passengers. This leads to rolling stock optimization problems with complex rules for vehicle maintenance. This problem is well studied in the literature for example see Maroti and Kroon 2005, or Cordeau et. al. 2001 for applications including vehicle maintenance. The contribution of this paper is a new algorithmic approach to solve the Rolling Stock Rotation Problem for the ICE high speed train fleet of DBF with included vehicle maintenance. It is based on a relaxation of a mixed integer&#13;
linear programming model with an iterative cut generation to enforce the feasibility of a solution of the relaxation in the solution space of the original problem. The resulting mixed integer linear programming model is based on a hypergraph approach presented in Borndörfer et. al. 2015. The new approach is tested on real world instances modeling different scenarios&#13;
for the ICE high speed train network in Germany and compared to the approaches&#13;
of Reuther 2017 that are in operation at DB Fernverkehr AG. The approach shows a significant reduction of the run time to produce solutions with comparable or even better objective function values.</abstract>
    <parentTitle language="deu">19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)</parentTitle>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="doi">https://doi.org/10.4230/OASIcs.ATMOS.2019.1</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-75501</identifier>
    <author>Boris Grimm</author>
    <submitter>Boris Grimm</submitter>
    <author>Ralf Borndörfer</author>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>19-61</number>
    </series>
    <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="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/7550/ZR-19-61.pdf</file>
  </doc>
  <doc>
    <id>7543</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1:1</pageFirst>
    <pageLast>1:12</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>75</volume>
    <type>conferenceobject</type>
    <publisherName>Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik</publisherName>
    <publisherPlace>Dagstuhl, Germany</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2019-09-14</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Cut Separation Approach for the Rolling Stock Rotation Problem with Vehicle Maintenance</title>
    <abstract language="eng">For providing railway services the company's railway rolling stock is one if not the most important ingredient. It decides about the number of passenger or cargo trips the company can offer, about the quality a passenger experiences the train ride and it is often related to the image of the company itself. Thus, it is highly desired to have the available rolling stock in the best shape possible. Moreover, in many countries, as Germany where our industrial partner DB Fernverkehr AG (DBF) is located, laws enforce regular vehicle inspections to ensure the safety of the passengers. This leads to rolling stock optimization problems with complex rules for vehicle maintenance. This problem is well studied in the literature for example see [Maróti and Kroon, 2005; Gábor Maróti and Leo G. Kroon, 2007], or [Cordeau et al., 2001] for applications including vehicle maintenance. The contribution of this paper is a new algorithmic approach to solve the Rolling Stock Rotation Problem for the ICE high speed train fleet of DBF with included vehicle maintenance. It is based on a relaxation of a mixed integer linear programming model with an iterative cut generation to enforce the feasibility of a solution of the relaxation in the solution space of the original problem. The resulting mixed integer linear programming model is based on a hypergraph approach presented in [Ralf Borndörfer et al., 2015]. The new approach is tested on real world instances modeling different scenarios for the ICE high speed train network in Germany and compared to the approaches of [Reuther, 2017] that are in operation at DB Fernverkehr AG. The approach shows a significant reduction of the run time to produce solutions with comparable or even better objective function values.</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.1</identifier>
    <identifier type="url">https://drops.dagstuhl.de/opus/volltexte/2019/11413/</identifier>
    <enrichment key="Series">OpenAccess Series in Informatics (OASIcs)</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="SubmissionStatus">epub ahead of print</enrichment>
    <enrichment key="FulltextUrl">https://drops.dagstuhl.de/opus/volltexte/2019/11413/pdf/OASIcs-ATMOS-2019-1.pdf</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-75501</enrichment>
    <author>Boris Grimm</author>
    <submitter>Boris Grimm</submitter>
    <editor>Valentina Cacchiani</editor>
    <author>Ralf Borndörfer</author>
    <editor>Alberto Marchetti-Spaccamela</editor>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</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="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="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="reuther">Reuther, Markus</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>5785</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>465</pageFirst>
    <pageLast>472</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Cycle Embedding Problem</title>
    <abstract language="eng">Given two hypergraphs, representing a fine and a coarse "layer", and a cycle cover of the nodes of the coarse layer, the cycle embedding problem (CEP) asks for an embedding of the coarse cycles into the fine layer. The CEP is NP-hard for general hypergraphs, but it can be solved in polynomial time for graphs. We propose an integer rogramming formulation for the CEP that provides a complete escription of the CEP polytope for the graphical case. The CEP comes up in railway vehicle rotation scheduling. We present computational results for problem instances of DB Fernverkehr AG that justify a sequential coarse-first-fine-second planning approach.</abstract>
    <parentTitle language="eng">Operations Research Proceedings 2014</parentTitle>
    <identifier type="doi">10.1007/978-3-319-28697-6_65</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-52788</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Marika Karbstein</author>
    <author>Julika Mehrgahrdt</author>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</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>
  </doc>
</export-example>
