<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>915</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation>DFG Reseach Center Matheon "Mathematics for Key Technologies"</creatingCorporation>
    <contributingCorporation>Technische Universität Berlin</contributingCorporation>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2007-11-01</completedDate>
    <publishedDate>2007-11-01</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">When Periodic Timetables are Suboptimal</title>
    <abstract language="eng">The timetable is the essence of the service offered by any provider of public transport'' (Jonathan Tyler, CASPT 2006). Indeed, the timetable has a major impact on both operating costs and on passenger comfort. Most European agglomerations and railways use periodic timetables in which operation repeats in regular intervals. In contrast, many North and South American municipalities use trip timetables in which the vehicle trips are scheduled individually subject to frequency constraints. We compare these two strategies with respect to vehicle operation costs. It turns out that for short time horizons, periodic timetabling can be suboptimal; for sufficiently long time horizons, however, periodic timetabling can always be done in an optimal way'.</abstract>
    <identifier type="serial">07-29</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1056</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-9151</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2007. Jörg Kalcsics, Stefan Nickel (eds.) Springer 2008, pp. 449-454</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>unknown unknown</submitter>
    <author>Christian Liebchen</author>
    <series>
      <title>ZIB-Report</title>
      <number>07-29</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Taktfahrplan</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Fahrplan</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Nahverkehr</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>periodic timetable</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>trip timetable</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>public transport</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/915/ZR_07_29.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/915/ZR_07_29.ps</file>
  </doc>
  <doc>
    <id>1361</id>
    <completedYear/>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>habilitation</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-07-27</completedDate>
    <publishedDate>2010-06-20</publishedDate>
    <thesisDateAccepted>2010-06-20</thesisDateAccepted>
    <title language="eng">Mathematical Optimization and Public Transportation</title>
    <abstract language="eng">This cumulative thesis collects the following six papers for obtaining the&#13;
habilitation at the Technische Universität Berlin, Fakultät II – Mathematik&#13;
und Naturwissenschaften:&#13;
(1) Set packing relaxations of some integer programs.&#13;
(2) Combinatorial packing problems.&#13;
(3) Decomposing matrices into blocks.&#13;
(4) A bundle method for integrated multi-depot vehicle and duty scheduling&#13;
in public transit.&#13;
(5) Models for railway track allocation.&#13;
(6) A column-generation approach to line planning in public transport.&#13;
Some changes were made to the papers compared to the published versions.&#13;
These pertain to layout unifications, i.e., common numbering, figure, table,&#13;
and chapter head layout. There were no changes with respect to notation or&#13;
symbols, but some typos have been eliminated, references updated, and some&#13;
links and an index was added. The mathematical content is identical.&#13;
The papers are about the optimization of public transportation systems,&#13;
i.e.,&#13;
bus networks, railways, and airlines, and its mathematical foundations,&#13;
i.e.,&#13;
the theory of packing problems. The papers discuss mathematical models,&#13;
theoretical analyses, algorithmic approaches, and computational aspects of&#13;
and to problems in this area.&#13;
Papers 1, 2, and 3 are theoretical. They aim at establishing a theory of&#13;
packing problems as a general framework that can be used to study traffic&#13;
optimization problems. Indeed, traffic optimization problems can often be&#13;
modelled as path packing, partitioning, or covering problems, which lead&#13;
directly to set packing, partitioning, and covering models. Such models are&#13;
used in papers 4, 5, and 6 to study a variety of problems concerning the&#13;
planning&#13;
of line systems, buses, trains, and crews. The common aim is always&#13;
to exploit as many degrees of freedom as possible, both at the level of the&#13;
individual problems by using large-scale integer programming techniques, as&#13;
well as on a higher level by integrating hitherto separate steps in the&#13;
planning&#13;
process.</abstract>
    <identifier type="urn">urn:nbn:de:0297-zib-13613</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Ralf Borndörfer</submitter>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>set packing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>set partitioning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>set covering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>polyhedral combinatorics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>public transport</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>railways</value>
    </subject>
    <collection role="msc" number="90-02">Research exposition (monographs, survey articles)</collection>
    <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="collections" number="">Habilitationen</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="BMBF-DS">BMBF-DS</collection>
    <collection role="projects" number="BMBF-IS">BMBF-IS</collection>
    <collection role="projects" number="LHS-CS">LHS-CS</collection>
    <collection role="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="projects" number="Trassenbörse">Trassenbörse</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <thesisPublisher>Zuse Institute Berlin (ZIB)</thesisPublisher>
    <thesisGrantor>Technische Universität Berlin</thesisGrantor>
    <file>https://opus4.kobv.de/opus4-zib/files/1361/Habil_Borndoerfer.pdf</file>
  </doc>
  <doc>
    <id>1107</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2008-12-18</completedDate>
    <publishedDate>2008-12-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Line Planning on Paths and Tree Networks with Applications to the Quito Trolebus System (Extended Abstract)</title>
    <abstract language="eng">Line planning is an important step in the strategic planning process of a public transportation system. In this paper, we discuss an optimization model for this problem in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the problem for path and tree network topologies as well as several categories of line operation that are important for the Quito Trolebus system. It turns out that, from a computational complexity worst case point of view, the problem is hard in all but the most simple variants. In practice, however, instances based on real data from the Trolebus System in Quito can be solved quite well, and significant optimization potentials can be demonstrated.</abstract>
    <identifier type="serial">08-53</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1148</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11076</identifier>
    <enrichment key="SourceTitle">Appeared in: ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Matteo Fischetti and Peter Widmayer (eds.)Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Dagstuhl, Germany, 2008. http://drops.dagstuhl.de/opus/volltexte/2008/1583</enrichment>
    <author>Luis Miguel Torres</author>
    <submitter>unknown unknown</submitter>
    <author>Ramiro Torres</author>
    <author>Ralf Borndörfer</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>08-53</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>computational complexity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>public transport</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1107/ZR_08_53.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1107/ZR_08_53.ps</file>
  </doc>
  <doc>
    <id>1086</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation>ZIB</creatingCorporation>
    <contributingCorporation>EPN Quito</contributingCorporation>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2008-08-19</completedDate>
    <publishedDate>2008-08-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Line Planning on Paths and Tree Networks with Applications to the Quito Trolebus System</title>
    <abstract language="eng">Line planning is an important step in the strategic planning process of a public transportation system. In this paper, we discuss an optimization model for this problem in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the problem for path and tree network topologies as well as several categories of line operation that are important for the Quito Trolebus system. It turns out that, from a computational complexity worst case point of view, the problem is hard in all but the most simple variants. In practice, however, instances based on real data from the Trolebus System in Quito can be solved quite well, and significant optimization potentials can be demonstrated.</abstract>
    <identifier type="serial">08-35</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1120</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-10869</identifier>
    <enrichment key="SourceTitle">Appeared in: ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Matteo Fischetti and Peter Widmayer (eds.) Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2008</enrichment>
    <author>Luis Miguel Torres</author>
    <submitter>unknown unknown</submitter>
    <author>Ramiro Torres</author>
    <author>Ralf Borndörfer</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>08-35</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>computational complexity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>public transport</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</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="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1086/ZR_08_35.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1086/ZR_08_35.ps</file>
  </doc>
</export-example>
