Abstract
Traffic information systems are among the most prominent real-world applications of Dijkstra's algorithm for shortest paths. We consider the scenario of a central information server in the realm of public railroad transport on wide-area networks. Such a system has to process a large number of on-line queries for optimal travel connections in real time. In practice, this problem is usually solved by heuristic variations of Dijkstra's algorithm, which do not guarantee an optimal result. We report results from a pilot study, in which we focused on the travel time as the only optimization criterion. In this study, various speed-up techniques for Dijkstra's algorithm were analysed empirically. This analysis was based on the timetable data of all German trains and on a "snapshot" of half a million customer queries.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Reference22 articles.
1. Algorithms for searching massive graphs
2. AHUJA R. MAGNANTI T. AND ORLIN J. 1993. Network Flows. Prentice-Hall. AHUJA R. MAGNANTI T. AND ORLIN J. 1993. Network Flows . Prentice-Hall.
3. ALBERS S. CRAUSER A. AND MEHLHORN K. 1997. Algorithmen für sehr große Datenmengen . MPI Saarbrücken. ALBERS S. CRAUSER A. AND MEHLHORN K. 1997. Algorithmen für sehr große Datenmengen . MPI Saarbrücken.
4. Modelling a hierarchy of space applied to large road networks
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献