Paying Less for Train Connections with MOTIS

Authors Matthias Müller-Hannemann, Mathias Schnee



PDF
Thumbnail PDF

File

OASIcs.ATMOS.2005.657.pdf
  • Filesize: 255 kB
  • 19 pages

Document Identifiers

Author Details

Matthias Müller-Hannemann
Mathias Schnee

Cite As Get BibTex

Matthias Müller-Hannemann and Mathias Schnee. Paying Less for Train Connections with MOTIS. In 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05). Open Access Series in Informatics (OASIcs), Volume 2, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006) https://doi.org/10.4230/OASIcs.ATMOS.2005.657

Abstract

Finding cheap train connections for long-distance traffic is algorithmically a hard task due to very complex tariff regulations. Several new tariff options have been developed in recent years, partly to react on the stronger competition with low-cost airline carriers. In such an environment, it becomes more and more important that search engines for travel connections are able to find special offers efficiently.
      We have developed a multi-objective traffic information system (MOTIS) which finds all attractive train connections with respect to travel time, number of interchanges, and ticket costs. In contrast, most servers for timetable information as well as the theoretical literature on this subject focus only on travel time as the primary objective, and secondary objectives like the number of interchanges are treated only heuristically.
      The purpose of this paper is to show by means of a case study how several of the most common tariff rules (including special offers) can be embedded into a general multi-objective search tool.
      Computational results show that a multi-objective search with a mixture of tariff rules can be done almost as fast as just with one regular tariff. For the train schedule of Germany, a query can be answered within 1.9s on average on a standard PC.

Subject Classification

Keywords
  • Timetable information system
  • multi-criteria optimization
  • shortest paths
  • fares
  • special offers
  • long-distance traffic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail