<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <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>7133</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-01-09</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Rolling Stock Rotation Planning Problem under Revenue Considerations</title>
    <abstract language="eng">In many railway undertakings a railway timetable is offered that is valid for a longer period of time. At DB Fernverkehr AG, one of our industrial partners, this results in a summer and a winter timetable. For both of these timetables rotation plans, i.e., a detailed plan of railway vehicle movements is constructed as a template for this period.  Sometimes there are be periods where you know for sure that vehicle capacities are not sufficient to cover all trips of the timetable or to transport all passenger of the trips. Reasons for that could be a heavy increase of passenger flow, a heavy decrease of vehicle availability, impacts from nature, or even strikes of some employees. In such events the rolling stock rotations have to be adapted. Optimization methods are particularly valuable in such situations in order to maintain a best possible level of service or to maximize the expected revenue using the resources that are still available. In most cases found in the literature, a rescheduling based on a timetable update is done, followed by the construction of new rotations that reward the recovery of parts of the obsolete rotations. We consider a different, novel, and more integrated approach. The idea is to guide the cancellation of the trips or reconfiguration of the vehicle composition used to operate a trip of the timetable by the rotation planning process, which is based on the mixed integer programming approach presented in Reuther (2017). The goal is to minimize the operating costs while cancelling or operating a trip with an insufficient vehicle configuration in sense of passenger capacities inflicts opportunity costs and loss of revenue, which are based on an estimation of the expected number of passengers. The performance of the algorithms presented in two case studies, including real world scenarios from DB Fernverkehr AG and a railway operator in North America.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-71339</identifier>
    <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>Christof Schulz</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>19-01</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="schulz">Schulz, Christof</collection>
    <collection role="persons" number="weider">Weider, Steffen</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/7133/ZR-19-01.pdf</file>
  </doc>
  <doc>
    <id>789</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2004-05-03</completedDate>
    <publishedDate>2004-05-03</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit</title>
    <abstract language="eng">This article proposes a Lagrangean relaxation approach to solve integrated duty and vehicle scheduling problems arising in public transport. The approach is based on the proximal bundle method for the solution of concave decomposable functions, which is adapted for the approximate evaluation of the vehicle and duty scheduling components. The primal and dual information generated by the bundle method is used to guide a branch-and-bound type algorithm. Computational results for large-scale real-world integrated vehicle and duty scheduling problems with up to 1,500 timetabled trips are reported. Compared with the results of a classical sequential approach and with reference solutions, integrated scheduling offers remarkable potentials in savings and drivers' satisfaction.</abstract>
    <identifier type="serial">04-14</identifier>
    <identifier type="opus3-id">790</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7898</identifier>
    <enrichment key="SourceTitle">Appeared in: Computer-aided Systems in Public Transport (CASPT 2005), M. Hickman et al. (eds.) 2008, pp. 3-24</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Andreas Löbel</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>04-14</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>crew scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integrated scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>public transit</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>bundle method</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="loebel">Löbel, Andreas</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <collection role="projects" number="BMBF-IS">BMBF-IS</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/789/ZR-04-14.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/789/ZR-04-14.pdf</file>
  </doc>
  <doc>
    <id>621</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2000-12-19</completedDate>
    <publishedDate>2000-12-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An Approximation Algorithm for the Non-Preemptive Capacitated Dial-a-Ride Problem</title>
    <abstract language="eng">In the Capacitated Dial-a-Ride Problem (CDARP) we are given a transportation network and a finite set of transportation jobs. Each job specifies the source and target location which are both part of the network. A server which can carry at most $C$~objects at a time can move on the transportation network in order to process the transportation requests. The problem CDARP consists of finding a shortest transportation for the jobs starting and ending at a designated start location. In this paper we are concerned with the restriction of CDARP to graphs which are simple paths. This setting arises for instance when modelling applications in elevator transportation systems. It is known that even for this restricted class of graphs CDARP is NP-hard to solve. We provide a polynomial time approximation algorithm that finds a transportion of length at most thrice the length of the optimal transportation.</abstract>
    <identifier type="serial">00-53</identifier>
    <identifier type="opus3-id">622</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6217</identifier>
    <author>Sven Krumke</author>
    <author>Jörg Rambau</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>00-53</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>NP-completeness</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>polynomial-time approximation algorithms</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>stacker-crane problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="68Q10">Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) [See also 68Q85]</collection>
    <collection role="msc" number="68Q25">Analysis of algorithms and problem complexity [See also 68W40]</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/621/ZR-00-53.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/621/ZR-00-53.pdf</file>
  </doc>
  <doc>
    <id>677</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-02-24</completedDate>
    <publishedDate>2002-02-24</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Integrierte Umlauf- und Dienstplanung im Öffentlichen Nahverkehr</title>
    <abstract language="deu">Wir beschreiben einen Ansatz zur integrierten Umlauf- und Dienstplanung im öffentlichen Nahverkehr. Der Ansatz zielt auf die Verbesserung des Gesamtwirkungsgrades dieser beiden Planungsschritte und auf die besondere Planungsproblematik im Regionalverkehr. Wir entwickeln dazu mathematische Optimierungstechniken für den Einsatz in den Planungssystemen MICROBUS II und DIVA.</abstract>
    <identifier type="serial">02-10</identifier>
    <identifier type="opus3-id">678</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6773</identifier>
    <enrichment key="SourceTitle">Erschienen in: Heureka '02: Optimierung in Verkehr und Transport, Forschungsgesellschaft für Strassen- und Verkehrwesen, Köln (2002), 77-98</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Andreas Löbel</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-10</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Integrierte Umlauf- und Dienstplanung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Umlaufplanung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Dienstplanung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Optimierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Regionalverkehr</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="loebel">Löbel, Andreas</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <collection role="projects" number="BMBF-IS">BMBF-IS</collection>
    <collection role="projects" number="PTVIS">PTVIS</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/677/ZR-02-10.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/677/ZR-02-10.pdf</file>
  </doc>
  <doc>
    <id>871</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2005-08-01</completedDate>
    <publishedDate>2005-08-01</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Column Generation Approach to Airline Crew Scheduling</title>
    <abstract language="eng">The airline crew scheduling problem deals with the construction of crew rotations in order to cover the flights of a given schedule at minimum cost. The problem involves complex rules for the legality and costs of individual pairings and base constraints for the availability of crews at home bases. A typical instance considers a planning horizon of one month and several thousand flights. We propose a column generation approach for solving airline crew scheduling problems that is based on a set partitioning model. We discuss algorithmic aspects such as the use of bundle techniques for the fast, approximate solution of linear programs, a pairing generator that combines Lagrangean shortest path and callback techniques, and a novel rapid branching'' IP heuristic. Computational results for a number of industrial instances are reported. Our approach has been implemented within the commercial crew scheduling system NetLine/Crew of Lufthansa Systems Berlin GmbH.</abstract>
    <identifier type="serial">05-37</identifier>
    <identifier type="opus3-id">871</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-8713</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2005. H.-D. Haasis et al. (eds.) Springer 2006, 343-348</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Uwe Schelten</author>
    <author>Thomas Schlechte</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>05-37</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Integer Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Airline Crew Scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Branch and Generate</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="institutes" number="">ZIB Allgemein</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="LHS-CS">LHS-CS</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/871/ZR-05-37.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/871/ZR-05-37.ps</file>
  </doc>
  <doc>
    <id>1642</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-11-06</completedDate>
    <publishedDate>2012-11-06</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integrated Optimization of Rolling Stock Rotations for Intercity Railways</title>
    <abstract language="eng">This paper provides a highly integrated solution approach for rolling stock &#13;
planning problems in the context of intercity passenger traffic. The main &#13;
contributions are a generic hypergraph based mixed integer programming &#13;
model and an integrated algorithm for the considered rolling stock rotation &#13;
planning problem. The new developed approach is able to handle a very large&#13;
set of industrial railway requirements, such as vehicle composition, &#13;
maintenance constraints, infrastructure capacity, and regularity aspects. &#13;
By the integration of this large bundle of technical railway aspects, we show &#13;
that our approach has the power to produce implementable rolling stock &#13;
rotations for our industrial cooperation partner DB Fernverkehr. &#13;
This is the first time that the rolling stock rotations at DB Fernverkehr &#13;
could be optimized by an automated system utilizing advanced mathematical &#13;
programming techniques.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-16424</identifier>
    <author>Markus Reuther</author>
    <submitter>Markus Reuther</submitter>
    <author>Ralf Borndörfer</author>
    <author>Thomas Schlechte</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-39</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed Integer Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Railway Optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Rolling Stock Rostering</value>
    </subject>
    <collection role="ccs" number="G.">Mathematics of Computing</collection>
    <collection role="pacs" number="00.00.00">GENERAL</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</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>
    <file>https://opus4.kobv.de/opus4-zib/files/1642/vrp.pdf</file>
  </doc>
  <doc>
    <id>1186</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation>Zuse Institut Berlin</creatingCorporation>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2010-08-24</completedDate>
    <publishedDate>2010-08-24</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Railway Track Allocation by Rapid Branching</title>
    <abstract language="eng">The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway network. Although it can be modeled as a standard path packing problem, instances of sizes relevant for real-world railway applications could not be solved up to now. We propose a rapid branching column generation approach that integrates the solution of the LP relaxation of a path coupling formulation of the problem with a special rounding heuristic. The approach is based on and exploits special properties of the bundle method for the approximate solution of convex piecewise linear functions. Computational results for difficult instances of the benchmark library TTPLIB are reported.</abstract>
    <identifier type="serial">10-22</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1247</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11864</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>unknown unknown</submitter>
    <author>Thomas Schlechte</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>10-22</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Trassenallokationsproblem</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Ganzzahlige Programmierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Rapid-Branching-Heuristik</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Proximale Bündelmethode</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Railway Track Allocation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Bundle Method</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Rapid Branching</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</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="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="Trassenbörse">Trassenbörse</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1186/ZR_10_22.pdf</file>
  </doc>
  <doc>
    <id>5607</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2015-07-09</completedDate>
    <publishedDate>2015-07-09</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&#13;
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&#13;
  airline rostering with a focus on the management of preferences, fairness, and fatigue, respectively.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-56070</identifier>
    <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>
    <series>
      <title>ZIB-Report</title>
      <number>15-44</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="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="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/5607/ZR-15-44.pdf</file>
  </doc>
  <doc>
    <id>5027</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2014-05-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Integrierte Dienst- und Dienstreihenfolgeplanung zur Erhöhung der Fahrerzufriedenheit</title>
    <abstract language="deu">Wir stellen einen mathematischen Optimierungsansatz zur integrierten Dienst- und Dienstreihenfolgeplanung&#13;
im öffentlichen Nahverkehr vor, mit dem sich bei konstanten Personalkosten&#13;
die Fahrerzufriedenheit deutlich steigern lässt.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-50270</identifier>
    <enrichment key="SourceTitle">Appeared in: Straßenverkehrstechnik. (2014) pp. 583-591</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Regine Kossick</submitter>
    <author>Bastian Dittbrenner</author>
    <author>Andreas Langenhan</author>
    <author>Stephan Seidl</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-02</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>duty scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>duty rostering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integrated scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Benders' decomposition</value>
    </subject>
    <collection role="ccs" number="J.2">PHYSICAL SCIENCES AND ENGINEERING</collection>
    <collection role="ccs" number="G.1.6">Optimization</collection>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="msc" number="90C10">Integer 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="weider">Weider, Steffen</collection>
    <collection role="projects" number="WS-OPT">WS-OPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5027/ZR-14-02.pdf</file>
  </doc>
  <doc>
    <id>5629</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2015-10-09</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integration of Duty Scheduling and Rostering to Increase Driver Satisfaction</title>
    <abstract language="eng">Integrated treatment of hitherto individual steps in the planning process of public transit companies discloses opportunities to reduce costs and to improve the quality of service. The arising integrated planning problems are complex and their solution requires the development of novel mathematical methods. This article proposes a mathematical optimization approach to integrate duty scheduling and rostering in public transit, which allows to significantly increase driver satisfaction at almost zero cost. This is important in order to to increase the attractiveness of the driver profession. The integration is based on coupling the subproblems by duty templates, which, compared to a coupling by duties, drastically reduces the problem complexity.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-56299</identifier>
    <submitter>Stephan Seidl</submitter>
    <author>Ralf Borndörfer</author>
    <author>Christof Schulz</author>
    <author>Stephan Seidl</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-50</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Benders decomposition</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>driver satisfaction</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>duty templates</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>duty scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>rostering</value>
    </subject>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="schulz">Schulz, Christof</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="WS-OPT">WS-OPT</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/5629/ZIBReport-15-50.pdf</file>
  </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>1469</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">Duty Scheduling Templates</title>
    <abstract language="eng">We propose duty templates as a novel concept to produce similar duty&#13;
schedules for similar days of operation in public transit. Duty templates&#13;
can conveniently handle various types of similarity requirements, and&#13;
they can be implemented with ease using standard algorithmic techniques.&#13;
They have produced good results in practice.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">12-09</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14699</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>Andreas Langenhan</author>
    <author>Andreas Löbel</author>
    <author>Christof Schulz</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-09</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>duty scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>duty templates</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="schulz">Schulz, Christof</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <collection role="projects" number="ZIB-Multicore">ZIB-Multicore</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1469/ZR-12-09.pdf</file>
  </doc>
</export-example>
