2026-07-26T02:59:56Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1169 2024-03-06T10:28:29Z ddc:004 open_access

14. Experimental Study on Speed-Up Techniques for Timetable Information Systems Bauer, Reinhard Delling, Daniel Wagner, Dorothea Speed-up techniques timetable information shortest path During the last years, impressive speed-up techniques for Dijkstra's algorithm have been developed. Unfortunately, recent research mainly focused on road networks. However, fast algorithms are also needed for other applications like timetable information systems. Even worse, the adaption of recently developed techniques to timetable information is often more complicated than expected. In this work, we check whether results from road networks are transferable to timetable information. To this end, we present an extensive experimental study of the most prominent speed-up techniques on different types of inputs. It turns out that recently developed techniques are much slower on graphs derived from timetable information than on road networks. In addition, we gain amazing insights into the behavior of speed-up techniques in general. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Reinhard Bauer and Daniel Delling and Dorothea Wagner 2007 Is Part Of OASIcs, Volume 7, 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07) (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2007.1169 urn:nbn:de:0030-drops-11695 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2007.1169 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode