Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Reuse of algorithms: still a challenge to object-oriented programming
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Empirical design of geometric algorithms
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
HiTi Graph Model of Topographical Roadmaps in Navigation Systems
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Modelling a Hierarchy of Space Applied to Large Road Networks
IGIS '94 Proceedings of the International Workshop on Advanced Information Systems: Geographic Information Systems
Recognizing Bundles in Time Table Graphs - A Structural Approach
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Pareto Shortest Paths is Often Feasible in Practice
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Fast Layout Methods for Timetable Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Evolutionary multiobjective route planning in dynamic multi-hop ridesharing
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Preprocessing speed-up techniques is hard
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Algorithm engineering for route planning: an update
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Engineering highway hierarchies
Journal of Experimental Algorithmics (JEA)
Parallel computation of best connections in public transportation networks
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
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 in real time. In practice, this problem is usually solved by heuristical variations of Dijkstra's algorithm, which do not guarantee optimality. We report results from a pilot study, in which we focused on the travel time as the only optimization criterion. In this study, various optimality-preserving speed-up techniques for Dijkstra's algorithm were analyzed empirically. This analysis was based on the timetable data of all German trains and on a "snapshot" of half a million customer queries.1