<?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-03T23:39:25Z</responseDate>
  <request identifier="27798" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:27798</identifier>
        <datestamp>2026-10-02T13:57:22Z</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>Passenger-Based Intermodal Connection Optimization with Elastic Demands</dc:title>
          <dc:creator>Grimm, Boris</dc:creator>
          <dc:creator>Borndörfer, Ralf</dc:creator>
          <dc:creator>Fraioli, Andrea</dc:creator>
          <dc:creator>Franke, Paula</dc:creator>
          <dc:creator>Giacco, Giovanni Luca</dc:creator>
          <dc:creator>Marinucci, Federico</dc:creator>
          <dc:creator>Montino, Tommaso</dc:creator>
          <dc:subject>Timetabling</dc:subject>
          <dc:subject>Demand Elasticity</dc:subject>
          <dc:subject>Discrete Choice</dc:subject>
          <dc:subject>Mixed-Integer Nonlinear Programming</dc:subject>
          <dc:subject>Heuristics</dc:subject>
          <dc:description>A railway network can attract additional passengers by improving the quality of service. One way to do that is to establish new train connections by slight shifts in arrival and departure times. We propose a connection optimization model to find a shifting of a given aperiodic timetable that maximizes the passenger volume, in which the demand is elastic and forecast by an integrated discrete choice logit model. The resulting large-scale mixed-integer non-linear non-convex programming problems can be solved by tailor-made heuristics for the entire Italian railway network with its 2,000 stations and 10,000 daily train trips, uncovering substantial potentials for connectivity improvements and boosts in demand.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Boris Grimm and Ralf Borndörfer and Andrea Fraioli and Paula Franke and Giovanni Luca Giacco and Federico Marinucci and Tommaso Montino</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.2</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-277980</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2026.2</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>
