首页    期刊浏览 2024年12月01日 星期日
登录注册

文章基本信息

  • 标题:Paying Less for Train Connections with MOTIS
  • 作者:Matthias M{\"u}ller-Hannemann ; Mathias Schnee
  • 期刊名称:OASIcs : OpenAccess Series in Informatics
  • 电子版ISSN:2190-6807
  • 出版年度:2006
  • 卷号:2
  • DOI:10.4230/OASIcs.ATMOS.2005.657
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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.
  • 关键词:Timetable information system; multi-criteria optimization; shortest paths; fares; special offers; long-distance traffic
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有