<?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-08-10T08:01:35Z</responseDate>
  <request identifier="2184" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2184</identifier>
        <datestamp>2024-03-06T11:08:50Z</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>Routing Cars in Rail Freight Service</dc:title>
          <dc:creator>Fügenschuh, Armin</dc:creator>
          <dc:creator>Homfeld, Henning</dc:creator>
          <dc:creator>Schuelldorf, Hanno</dc:creator>
          <dc:subject>Mixed-Integer Programming</dc:subject>
          <dc:subject>Branch-and-Cut</dc:subject>
          <dc:subject>Logistics</dc:subject>
          <dc:subject>Routing and Scheduling</dc:subject>
          <dc:description>Cars in rail freight services at Deutsche Bahn follow prescribed routes from their origin via intermediate shunting yards to their destination. The main goal in designing such routes is to reduce the number of trains and their travel distances. Various real-world capacity constraints make the problem difficult to formulate and also to solve. We present MILP and MINLP models for this problem based on multicommodity flows and arborescences. We compare these formulations using test- and real-world data.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Armin Fügenschuh and Henning Homfeld and Hanno Schuelldorf</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)</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/DagSemProc.09261.25</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-21848</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.25</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
