<?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-10-04T00:29:16Z</responseDate>
  <request identifier="27802" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:27802</identifier>
        <datestamp>2026-10-02T13:58:19Z</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>From Routes to Resources: A Model for Real-Time Train Dispatching with No-Wait Constraints</dc:title>
          <dc:creator>Stärk, Luka</dc:creator>
          <dc:creator>Borndörfer, Ralf</dc:creator>
          <dc:creator>Lindner, Niels</dc:creator>
          <dc:subject>Train Dispatching</dc:subject>
          <dc:subject>No-Wait Constraints</dc:subject>
          <dc:subject>Disjunctive Graph</dc:subject>
          <dc:subject>Edge Clique Cover</dc:subject>
          <dc:subject>Microscopic Railway Timetabling</dc:subject>
          <dc:description>Optimization for train dispatching promises to reduce delays. Yet scalable applications are challenging. We present an efficient MIP model, based on generalized disjunctive graphs, for the train dispatching problem with no-wait constraints. For each train, we model its possible movements with microscopic detail as a DAG of operations. We select one train path per DAG and associate it with reservation and release times for the exclusive infrastructure it uses, such that the resulting schedule is conflict-free. When the connecting velocity between consecutive operations is positive, no-wait constraints apply. Additionally, we give a procedure to transform realistic infrastructure constraints based on route exclusions into an equivalent representation on resources by means of edge clique covers and incorporation of overlap exclusions. This makes resource-based dispatching models applicable to real-life infrastructure. We embed the MIP into an iterative algorithm, which we evaluate on the DISPLIB benchmark set and on a real-life dataset from German dispatching regions that we publish together with this paper. We prove optimality for 70 of the 112 DISPLIB instances within short running times, and we find 27 new best known solutions within a 10-minute time limit.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Luka Stärk and Ralf Borndörfer and Niels Lindner</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 147, 26th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2026)</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.2026.6</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-278024</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2026.6</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>
