Experimental study of speed up techniques for timetable information systems

Authors:
Reinhard Bauer;Daniel Delling;Dorothea Wagner
Affiliations:
Karlsruhe Institute of Technology, Department of Computer Science, 76128 Karlsruhe, Germany;Karlsruhe Institute of Technology, Department of Computer Science, 76128 Karlsruhe, Germany;Karlsruhe Institute of Technology, Department of Computer Science, 76128 Karlsruhe, Germany
Venue:
Networks
Year:
2011

Citing 0
Cited 3

Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Parallel computation of best connections in public transportation networks

Journal of Experimental Algorithmics (JEA)
Integrating public transportation in personalised electronic tourist guides

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, many speed up techniques for DIJKSTRA Algorithm have been developed. Unfortunately, research mainly focused on road networks although fast algorithms are also needed for other applications like timetable information systems. Even worse, the adaption of recently developed techniques to graphs deriving from timetable information problems is often more complicated than expected. In this work, we check whether results from road networks are transferable to timetable information systems. To this end, we present an extensive experimental study of the most prominent speed up techniques on inputs deriving from different applications. It turns out that recently developed techniques are much slower on graphs derived from timetable information problems than on road networks. In addition, we gain interesting insights into the behavior of speed up techniques in general. © 2010 Wiley Periodicals, Inc. NETWORKS, 2011 © 2011 Wiley Periodicals, Inc.