文章基本信息

标题：Experimental Study on Speed-Up Techniques for Timetable Information Systems
本地全文：下载
作者：Bauer, Reinhard ; Delling, Daniel ; Wagner, Dorothea 等
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2007
卷号：7
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Speed-up techniques; timetable information; shortest path