<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5278</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>2014-10-15</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>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-52788</identifier>
    <identifier type="doi">10.1007/978-3-319-28697-6_65</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2014</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Marika Karbstein</author>
    <author>Julika Mehrgardt</author>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-37</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>cycle embedding problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>railway vehicle rotation scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>sequential coarse-first-fine-second planning approach</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="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/5278/ZR-14-37.pdf</file>
  </doc>
  <doc>
    <id>5136</id>
    <completedYear/>
    <publishedYear>2014</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>49</pageFirst>
    <pageLast>55</pageLast>
    <pageNumber/>
    <edition>Operations Research Proceedings 2013</edition>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer International Publishing</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Re-Optimization of Rolling Stock Rotations</title>
    <abstract language="eng">The Rolling Stock Rotation Problem is to schedule rail vehicles in order to cover timetabled trips by a cost optimal set of vehicle rotations. The problem integrates several facets of railway optimization, such as vehicle composition, maintenance constraints, and regularity aspects. In industrial applications existing vehicle rotations often have to be re-optimized to deal with timetable changes or construction sites. We present an integrated modeling and algorithmic approach to this task as well as computational results for industrial problem instances of DB Fernverkehr AG.</abstract>
    <identifier type="doi">10.1007/978-3-319-07001-8_8</identifier>
    <enrichment key="Series">Operations Research Proceedings 2013</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-42569</enrichment>
    <submitter>Thomas Schlechte</submitter>
    <author>Ralf Borndörfer</author>
    <author>Julika Mehrgardt</author>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <author>Kerstin Waas</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>
  <doc>
    <id>5135</id>
    <completedYear/>
    <publishedYear>2014</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>37</pageFirst>
    <pageLast>42</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Analysis of Micro–Macro Transformations of Railway Networks</title>
    <abstract language="eng">A common technique in the solution of large or complex optimization problems is the use of micro–macro transformations. In this paper, we carry out a theoretical analysis of such transformations for the track allocation problem in railway networks. We prove that the cumulative rounding  technique of Schlechte et al. satisfies two of three natural optimality criteria and that this performance cannot be improved. We also show that under extreme circumstances, this technique can perform inconveniently by underestimating the global optimal value.</abstract>
    <parentTitle language="eng">Operations Research Proceedings 2013</parentTitle>
    <identifier type="doi">10.1007/978-3-319-07001-8_6</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-42710</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="Series">Operations Research Proceedings 2013</enrichment>
    <author>Marco Blanco</author>
    <submitter>Marco Blanco</submitter>
    <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="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="KOSMOS">KOSMOS</collection>
    <collection role="projects" number="Trassenbörse">Trassenbörse</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>5276</id>
    <completedYear/>
    <publishedYear>2014</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>293</pageFirst>
    <pageLast/>
    <pageNumber>1</pageNumber>
    <edition/>
    <issue/>
    <volume>8768</volume>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Price of Spite in Spot-checking games</title>
    <abstract language="eng">We introduce the class of spot-checking games (SC games). These games model&#13;
problems where the goal is to distribute fare inspectors over a toll network.&#13;
Although SC games are not zero-sum, we show that a Nash equilibrium&#13;
can be computed by linear programming.&#13;
The computation of a strong Stackelberg equilibrium is&#13;
more relevant for this problem, but we show that this is NP-hard.&#13;
However, we give some bounds on the \emph{price of spite},&#13;
which measures how the&#13;
payoff of the inspector&#13;
degrades when committing to a Nash equilibrium. &#13;
Finally, we demonstrate the quality of these bounds for a real-world application,&#13;
namely the enforcement of a truck toll on German motorways.</abstract>
    <parentTitle language="eng">7th International Symposium on Algorithmic Game Theory (SAGT'2014)</parentTitle>
    <identifier type="isbn">978-3-662-44802-1</identifier>
    <identifier type="doi">10.1007/978-3-662-44803-8</identifier>
    <note>Brief Announcement included in Back Matter p. 293 following</note>
    <enrichment key="Series">Lecture Notes in Computer Science</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-52775</enrichment>
    <editor>Ron Lavi</editor>
    <submitter>Guillaume Sagnol</submitter>
    <author>Guillaume Sagnol</author>
    <author>Ralf Borndörfer</author>
    <author>Thomas Schlechte</author>
    <author>Elmar Swarat</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="swarat">Swarat, Elmar</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>6432</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Pattern Detection For Large-Scale Railway Timetables</title>
    <abstract language="eng">We consider railway timetables of our industrial partner DB Fernverkehr AG that operates the ICE high speed trains in the long-distance passenger railway network of Germany. Such a timetable covers a whole year with 364 days and, typically, includes more than 45,000 trips. A rolling stock rotation plan is not created for the whole timetable at once. Instead the timetable is divided into regular invariant sections and irregular deviations (e.g. for public holidays). A separate rotation plan with a weekly period can then be provided for each of the different sections of the timetable. We present an algorithmic approach to automatically recognize these sections. Together with the supplementing visualisation of the timetable this method has shown to be very relevant for our industrial partner.</abstract>
    <parentTitle language="eng">Proceedings of the IAROR conference RailLille</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-63390</enrichment>
    <author>Stanley Schade</author>
    <submitter>Stanley Schade</submitter>
    <author>Ralf Borndörfer</author>
    <author>Matthias Breuer</author>
    <author>Boris Grimm</author>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <author>Patrick Siebeneicher</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</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="persons" number="schade">Schade, Stanley</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>5729</id>
    <completedYear>2015</completedYear>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2015-07-23</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Duty Rostering in Public Transport - Facing Preferences, Fairness, and Fatigue</title>
    <abstract language="eng">Duty rostering problems occur in different application contexts and come in different flavors. They give rise to very large scale integer programs which ypically have lots of solutions and extremely fractional LP relaxations. In such a situation, heuristics can be a viable algorithmic choice. We propose an mprovement method of the Lin-Kernighan type for the solution of duty rostering problems. We illustrate its versatility and solution quality on three different applications in public transit, vehicle routing, and airline rostering with a focus on the management of preferences, fairness, and fatigue, respectively.</abstract>
    <parentTitle language="eng">Proceedings of Conference on Advanced Systems in Public Transport 2015 (CASPT2015)</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-56070</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <author>Christof Schulz</author>
    <author>Elmar Swarat</author>
    <author>Steffen Weider</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="persons" number="schulz">Schulz, Christof</collection>
    <collection role="persons" number="swarat">Swarat, Elmar</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <collection role="projects" number="LHS-CS">LHS-CS</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="projects" number="VS-Rail">VS-Rail</collection>
    <collection role="projects" number="WS-OPT">WS-OPT</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>5711</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>863</pageFirst>
    <pageLast>877</pageLast>
    <pageNumber>15</pageNumber>
    <edition/>
    <issue>3</issue>
    <volume>50</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integrated Optimization of Rolling Stock Rotations for Intercity Railways</title>
    <abstract language="eng">This paper proposes a highly integrated solution approach for rolling stock planning problems in the context of long distance passenger traffic between cities. The main contributions are a generic hypergraph-based mixed-integer programming model for the considered rolling stock rotation problem and an integrated algorithm for its solution. The newly developed algorithm is able to handle a large spectrum of industrial railway requirements, such as vehicle composition, maintenance constraints, infrastructure capacities, and regularity aspects. We show that our approach has the power to produce rolling stock rotations that can be implemented in practice. In this way, the rolling stock rotations at the largest German long distance operator Deutsche Bahn Fernverkehr AG could be optimized by an automated system utilizing advanced mathematical programming techniques.</abstract>
    <parentTitle language="eng">Transportation Science</parentTitle>
    <identifier type="doi">10.1287/trsc.2015.0633</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="FulltextUrl">http://pubsonline.informs.org/doi/abs/10.1287/trsc.2015.0633</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-16424</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <author>Kerstin Waas</author>
    <author>Steffen Weider</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="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="weider">Weider, Steffen</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>
  <doc>
    <id>5725</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>343</pageFirst>
    <pageLast>348</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>50</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the Path Avoiding Forbidden Pairs Polytope</title>
    <abstract language="eng">Given a directed, acyclic graph, a source and a sink node, and a set of forbidden pairs of arcs, the path avoiding forbidden pairs (PAFP) problem is to find a path that connects the source and sink nodes and contains at most one arc from each forbidden pair. The general version of the problem is NP-hard, but it becomes polynomially solvable for certain topological configurations of the pairs. We present the first polyhedral study of the PAFP problem. We introduce a new family of valid inequalities for the PAFP polytope and show that they are sufficient to provide a complete linear description in the special case where the forbidden pairs satisfy a disjointness property. Furthermore, we show that the number of facets of the PAFP polytope is exponential in the size of the graph, even for the case of a single forbidden pair.</abstract>
    <parentTitle language="eng">Electronic Notes in Discrete Mathematics</parentTitle>
    <identifier type="doi">10.1016/j.endm.2015.07.057</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Marco Blanco</author>
    <submitter>Nam-Dung Hoang</submitter>
    <author>Ralf Borndörfer</author>
    <author>Michael Brückner</author>
    <author>Nam-Dung Hoang</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="persons" number="brueckner">Brückner, Michael</collection>
    <collection role="projects" number="LHS-ATN">LHS-ATN</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>6183</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>19</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Template-based Re-optimization of Rolling Stock Rotations</title>
    <abstract language="eng">Rolling stock, i.e., the set of railway vehicles, is among the most&#13;
expensive and limited assets of a railway company and must be used&#13;
efficiently. We consider in this paper the re-optimization&#13;
problem to recover from unforeseen disruptions. We propose a&#13;
template concept that allows to recover cost minimal rolling&#13;
stock rotations from reference rotations under a large variety of&#13;
operational requirements. To this end, connection templates as&#13;
well as rotation templates are introduced and their&#13;
application within a rolling stock rotation planning model is&#13;
discussed. We present an implementation within the rolling stock rotation&#13;
optimization framework rotor and computational results for&#13;
scenarios provided by DB Fernverkehr AG, one of the &#13;
leading railway operators in Europe.</abstract>
    <parentTitle language="eng">Public Transport</parentTitle>
    <identifier type="doi">10.1007/s12469-017-0152-4</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Thomas Schlechte</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="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>
  <doc>
    <id>4510</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>2013-12-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal Toll Enforcement - an Integration of Vehicle Routing and Duty Rostering</title>
    <abstract language="eng">We present the problem of planning mobile tours of inspectors on German motorways to enforce the payment of the toll for heavy good trucks. This is a special type of vehicle routing problem with the objective to conduct as good inspections as possible on the complete network. In addition, the crews of the tours have to be scheduled. Thus, we developed a personalized crew rostering model. The planning of daily tours and the rostering are combined in a novel integrated approach and formulated as a complex and large scale Integer Program. The paper focuses first on different requirements for the rostering and how they can be modeled in detail. The second focus is on a bicriterion analysis of the planning problem to find the balance between the control quality and the roster acceptance. On the one hand the tour planning is a profit maximization problem and on the other hand the rostering should be made in a employee friendly way. Finally, computational results on real-world instances show the practicability of our method.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-45107</identifier>
    <identifier type="doi">10.1007/s10479-016-2152-1</identifier>
    <enrichment key="SourceTitle">Appeared in: Annals of Operations Research (2016)</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Elmar Swarat</submitter>
    <author>Guillaume Sagnol</author>
    <author>Thomas Schlechte</author>
    <author>Elmar Swarat</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-79</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>crew rostering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>bicriteria optimization</value>
    </subject>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="msc" number="90C06">Large-scale problems</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="swarat">Swarat, Elmar</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/4510/ZR-13-79.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/4510/ZR-13-79_revised.pdf</file>
  </doc>
  <doc>
    <id>5291</id>
    <completedYear>2014</completedYear>
    <publishedYear>2014</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>79</pageFirst>
    <pageLast>91</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>42</volume>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem</title>
    <abstract language="eng">We propose a new coarse-to-fine approach to solve certain linear programs by column generation. The problems that we address contain layers corresponding to different levels of detail, i.e., coarse layers as well as fine layers. These layers are utilized to design efficient pricing rules. In a nutshell, the method shifts the pricing of a fine linear program to a coarse counterpart. In this way, major decisions are taken in the coarse layer, while minor details are tackled within the fine layer. We elucidate our methodology by an application to a complex railway rolling stock rotation problem. We provide comprehensive computational results that demonstrate the benefit of this new technique for the solution of large scale problems.</abstract>
    <parentTitle language="eng">14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems</parentTitle>
    <identifier type="doi">10.4230/OASIcs.ATMOS.2014.79</identifier>
    <enrichment key="Series">OpenAccess Series in Informatics (OASIcs)</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-51009</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Markus Reuther</submitter>
    <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>
  <doc>
    <id>1472</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-02-22</completedDate>
    <publishedDate>2012-02-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Rapid Branching</title>
    <abstract language="eng">We propose rapid branching (RB) as a general branch-and-bound heuristic&#13;
for solving large scale optimization problems in traffic and transport.&#13;
The key idea is to combine a special branching rule and a greedy node selection&#13;
strategy in order to produce solutions of controlled quality rapidly&#13;
and efficiently. We report on three successful applications of the method&#13;
for integrated vehicle and crew scheduling, railway track allocation, and&#13;
railway vehicle rotation planning.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">12-10</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14728</identifier>
    <enrichment key="SourceTitle">A rev. vers. appeared in: . C. Muñoz and S. Voß (eds.), Proceedings of the 12th International Conference on Advanced Systems for Public Transport (CASPT12), Santiago, Chile, 2012</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Regine Kossick</submitter>
    <author>Andreas Löbel</author>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-10</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>large scale optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>rapid branching</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>column generation</value>
    </subject>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="loebel">Löbel, Andreas</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <collection role="projects" number="BMBF-IS">BMBF-IS</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/1472/ZR-12-10.pdf</file>
  </doc>
  <doc>
    <id>1473</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-02-22</completedDate>
    <publishedDate>2012-02-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Vehicle Rotation Planning for Intercity Railways</title>
    <abstract language="eng">This paper provides a generic formulation for rolling stock planning&#13;
problems in the context of intercity passenger traffic. The main contributions&#13;
are a graph theoretical model and a Mixed-Integer-Programming&#13;
formulation that integrate all main requirements of the considered&#13;
Vehicle-Rotation-Planning problem (VRPP). We show that it is&#13;
possible to solve this model for real-world instances provided by our&#13;
industrial partner DB Fernverkehr AG using modern algorithms and&#13;
computers.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">12-11</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14731</identifier>
    <enrichment key="SourceTitle">A rev. vers. appeared in: J. C. Muñoz and S. Voß (eds.), Proc. Conference on Advanced Systems for Public Transport 2012 (CASPT12), 2012</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Regine Kossick</submitter>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-11</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>rolling-stock-planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mixed-integer-programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>hypergraphs</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>column generation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>rapid branching</value>
    </subject>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C10">Integer 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/1473/ZR-12-11.pdf</file>
  </doc>
  <doc>
    <id>8039</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>102726</pageFirst>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>119</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</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 a cost-oriented approach considering transfer of resources during a finite length planning horizon of multiple periods. We use real-life public transportation network data for our computational results. 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 period lengths along with the problem parameters that are significant for and sensitive to the optimality of solutions.</abstract>
    <parentTitle language="eng">Transportation Research Part C: Emerging Technologies</parentTitle>
    <identifier type="doi">10.1016/j.trc.2020.102726</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">2020-07-13</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-74662</enrichment>
    <submitter>Ralf Borndörfer</submitter>
    <author>Guvenc Sahin</author>
    <author>Amin Ahmadi</author>
    <author>Ralf Borndörfer</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="MATHEON-B15">MATHEON-B15</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="projects" number="MathPlus-Incubator-Timetabling">MathPlus-Incubator-Timetabling</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <collection role="projects" number="MODAL-MobilityLab">MODAL-MobilityLab</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>8821</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>11:1</pageFirst>
    <pageLast>11:8</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>106</volume>
    <type>conferenceobject</type>
    <publisherName>Schloss Dagstuhl -- Leibniz-Zentrum für Informatik</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2022-09-06</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Does Laziness Pay Off? - A Lazy-Constraint Approach to Timetabling</title>
    <abstract language="eng">Timetabling is a classical and complex task for public transport operators as well as for railway undertakings. The general question is: Which vehicle is taking which route through the transportation network in which order? In this paper, we consider the special setting to find optimal timetables for railway systems under a moving block regime. We directly set up on our work of [8 ], i.e., we consider the same model formulation and real-world instances of a moving block headway system. In this paper, we present a repair heuristic and a lazy-constraint approach utilizing the callback features of Gurobi, see [3]. We provide an experimental study of the different algorithmic approaches for a railway network with 100 and up to 300 train requests. The computational results show that the lazy-constraint approach together with the repair heuristic significantly improves our previous approaches.</abstract>
    <parentTitle language="eng">22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)</parentTitle>
    <identifier type="doi">10.4230/OASIcs.ATMOS.2022.11</identifier>
    <enrichment key="Series">Open Access Series in Informatics (OASIcs)</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Torsten Klug</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="klug">Klug, Torsten</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="reuther">Reuther, Markus</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <collection role="projects" number="MODAL-MobilityLab">MODAL-MobilityLab</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>8407</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>100315</pageFirst>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>22</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Timetable Optimization for a Moving Block System</title>
    <abstract language="eng">We present an optimization model which is capable of routing and ordering trains on a microscopic level under a moving block regime. Based on a general timetabling definition (GTTP) that allows the plug in of arbitrarily detailed methods to compute running and headway times, we describe a layered graph approach using velocity expansion, and develop a mixed integer linear programming formulation. Finally, we present promising results for a German corridor scenario with mixed traffic, indicating that applying branch-and-cut to our model is able to solve reasonably sized instances with up to hundred trains to optimality.</abstract>
    <parentTitle language="eng">Journal of Rail Transport Planning &amp; Management</parentTitle>
    <identifier type="doi">10.1016/j.jrtpm.2022.100315</identifier>
    <identifier type="issn">2210-9706</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">2021-03-25</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-82547</enrichment>
    <author>Thomas Schlechte</author>
    <submitter>Niels Lindner</submitter>
    <author>Ralf Borndörfer</author>
    <author>Jonas Denißen</author>
    <author>Simon Heller</author>
    <author>Torsten Klug</author>
    <author>Michael Küpper</author>
    <author>Niels Lindner</author>
    <author>Markus Reuther</author>
    <author>Andreas Söhlke</author>
    <author>William Steadman</author>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="klug">Klug, Torsten</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="reuther">Reuther, Markus</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>
  </doc>
  <doc>
    <id>9366</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>other</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Bouquet of Features in Rolling Stock Rotation Planning</title>
    <abstract language="eng">Rolling stock is one of the major assets for a railway transportation company. Hence, their utilization should be as efficiently and effectively as possible. Railway undertakings are facing rolling stock scheduling challenges in different forms - from rather idealized weekly strategic problems to very concrete operational ones. Thus, a vast of optimization models with different features and objectives exist. Thorlacius et al. (2015) provides a comprehensive and valuable collection on technical requirements, models, and methods considered in&#13;
the scientific literature. We contribute with an update including recent works. The main focus of the paper is to present a classification and elaboration of the major features which our solver R-OPT is able to handle. Moreover, the basic optimization model and algorithmic ingredients of R-OPT are discussed. Finally, we present computational results for a cargo application at SBB CARGO AG and other railway undertakings for passenger traffic in Europe to show the capabilities of R-OPT.</abstract>
    <parentTitle language="deu">Conference Proceedings RailBelgrade 2023</parentTitle>
    <identifier type="url">https://easychair.org/publications/preprint/Nms6</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="SubmissionStatus">epub ahead of print</enrichment>
    <enrichment key="AcceptedDate">06.03.2023</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Thomas Schlechte</author>
    <submitter>Ralf Borndörfer</submitter>
    <author>Christian Blome</author>
    <author>Stefan Gerber</author>
    <author>Stefan Hauser</author>
    <author>Jens Kasten</author>
    <author>Gilbert Müller</author>
    <author>Christof Schulz</author>
    <author>Michel Thüring</author>
    <author>Steffen Weider</author>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="schulz">Schulz, Christof</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <collection role="projects" number="MODAL-MobilityLab">MODAL-MobilityLab</collection>
  </doc>
  <doc>
    <id>9505</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>106186</pageFirst>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>154</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-02-24</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A three-phase heuristic for the Fairness-Oriented Crew Rostering Problem</title>
    <abstract language="eng">The Fairness-Oriented Crew Rostering Problem (FCRP) considers the joint optimization of attractiveness and fairness in cyclic crew rostering. Like many problems in scheduling and logistics, the combinatorial complexity of cyclic rostering causes exact methods to fail for large-scale practical instances. In case of the FCRP, this is accentuated by the additionally imposed fairness requirements. Hence, heuristic methods are necessary. We present a three-phase heuristic for the FCRP combining column generation techniques with variable-depth neighborhood search. The heuristic exploits different mathematical formulations to find feasible solutions and to search for improvements. We apply our methodology to practical instances from Netherlands Railways (NS), the main passenger railway operator in the Netherlands Our results show the three-phase heuristic finds good solutions for most instances and outperforms a state-of-the-art commercial solver.</abstract>
    <parentTitle language="eng">Computers &amp; Operations Research</parentTitle>
    <identifier type="doi">10.1016/j.cor.2023.106186</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="SubmissionStatus">epub ahead of print</enrichment>
    <enrichment key="AcceptedDate">2023-03-06</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Thomas Breugem</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Thomas Schlechte</author>
    <author>Christof Schulz</author>
    <author>Ralf Borndörfer</author>
    <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="WS-OPT">WS-OPT</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
  </doc>
  <doc>
    <id>9282</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>6</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Springer International Publishing</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Line Planning Problem</title>
    <parentTitle language="eng">Encyclopedia of Optimization</parentTitle>
    <identifier type="isbn">978-3-030-54621-2</identifier>
    <identifier type="doi">10.1007/978-3-030-54621-2_782-1</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Güvenç Şahin</author>
    <submitter>Niels Lindner</submitter>
    <editor>P. M. Pardalos</editor>
    <author>Niels Lindner</author>
    <editor>O. A. Prokopyev</editor>
    <author>Thomas Schlechte</author>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="lindner">Lindner, Niels</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <collection role="projects" number="SymLPP">SymLPP</collection>
  </doc>
  <doc>
    <id>8232</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>77</pageFirst>
    <pageLast>86</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>1</volume>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An LP-based heuristic for Inspector Scheduling</title>
    <abstract language="eng">We present a heuristic based on linear programming (LP) for the&#13;
integrated tour and crew roster planning of toll enforcement inspectors. Their&#13;
task is to enforce the proper paying of a distance-based toll on German motorways. This leads to an integrated tour planning and duty rostering problem; it&#13;
is called Toll Enforcement Problem (TEP). We tackle the TEP by a standard&#13;
multi-commodity flow model with some extensions in order to incorporate the&#13;
control tours.&#13;
The heuristic consists of two variants. The first, called Price &amp; Branch, is&#13;
a column generation approach to solve the model’s LP relaxation by pricing&#13;
tour and roster arc variables. Then, we compute an integer feasible solution&#13;
by restricting to all variables that were priced. The second is a coarse-to-fine approach. Its basic idea is projecting variables to an aggregated variable&#13;
space, which is much smaller. The aim is to spend as much algorithmic effort&#13;
in this coarse model as possible. For both heuristic procedures we will show&#13;
that feasible solutions of high quality can be computed even for large scale industrial instances.</abstract>
    <parentTitle language="eng">Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021: Volume I</parentTitle>
    <identifier type="url">https://patatconference.org/patat2020/proceedings/</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>Gerwin Gamrath</author>
    <submitter>Elmar Swarat</submitter>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <author>Elmar Swarat</author>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="swarat">Swarat, Elmar</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="persons" number="reuther">Reuther, Markus</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
  </doc>
</export-example>
