<?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-26T05:32:04Z</responseDate>
  <request identifier="1178" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1178</identifier>
        <datestamp>2024-03-06T10:28:29Z</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>16. Improved Search for Night Train Connections</dc:title>
          <dc:creator>Gunkel, Thorsten</dc:creator>
          <dc:creator>Müller-Hannemann, Matthias</dc:creator>
          <dc:creator>Schnee, Mathias</dc:creator>
          <dc:subject>Timetable information system</dc:subject>
          <dc:subject>multi-criteria optimization</dc:subject>
          <dc:subject>night trains</dc:subject>
          <dc:subject>computational study</dc:subject>
          <dc:description>The search for attractive night train connections is&#13;
fundamentally different from ordinary search:&#13;
the primary objective of a costumer of a&#13;
night train is to have a reasonably long sleeping period without&#13;
interruptions due to train changes. For most passenger it is also&#13;
undesired to reach the final destination too early in the morning.&#13;
These objectives are in sharp contrast to standard information systems&#13;
which focus on minimizing the total travel time.&#13;
&#13;
In this paper we present and compare&#13;
two new approaches to support queries for night train&#13;
connections. These approaches have been integrated into&#13;
the Multi-Objective Traffic Information System (MOTIS)&#13;
which is currently developed by our group.&#13;
Its purpose is to find all train connections which are attractive from&#13;
a costumer point of view.&#13;
&#13;
With a computational study we demonstrate that our specialized algorithms&#13;
for night train connections are able to satisfy costumer queries much better&#13;
than standard methods. This can be achieved with reasonable computational&#13;
costs: a specialized night train search requires only a few seconds of&#13;
CPU time.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Thorsten Gunkel and Matthias Müller-Hannemann and Mathias Schnee</dc:contributor>
          <dc:date>2007</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 7, 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07) (2007)</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.2007.1178</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-11781</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2007.1178</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>
