• graph algorithms;
  • shortest paths;
  • algorithm engineering;
  • timetable information;
  • experimental study


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