<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T05:24:52Z</responseDate>
  <request identifier="686" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:686</identifier>
        <datestamp>2024-03-06T10:28:25Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Locomotive and Wagon Scheduling in Freight Transport</dc:title>
          <dc:creator>Fügenschuh, Armin</dc:creator>
          <dc:creator>Homfeld, Henning</dc:creator>
          <dc:creator>Huck, Andreas</dc:creator>
          <dc:creator>Martin, Alexander</dc:creator>
          <dc:subject>Freight Transport</dc:subject>
          <dc:subject>Vehicle Scheduling</dc:subject>
          <dc:subject>Time Windows</dc:subject>
          <dc:subject>Integer Programming.</dc:subject>
          <dc:description>We present a new model for a strategic locomotive scheduling problem&#13;
  arising at the Deutsche Bahn AG. The model is based on a&#13;
  multi-commodity min-cost flow formulation that is also used for&#13;
  public bus scheduling problems. However, several new aspects have to&#13;
  be additionally taken into account, such as cyclic departures of the&#13;
  trains, time windows on starting and arrival times, network-load&#13;
  dependend travel times, and a transfer of wagons between trains. The&#13;
  model is formulated as an integer programming problem, and solutions&#13;
  are obtained using commercial standard software. Computational&#13;
  results for several test instances are presented.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Armin Fügenschuh and Henning Homfeld and Andreas Huck and Alexander Martin</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/OASIcs.ATMOS.2006.686</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-6863</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.686</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
