Introduction to algorithms
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Guidelines for reporting results of computational experiments. Report of the ad hoc committee
Mathematical Programming: Series A and B
Analyzing algorithms by simulation: variance reduction techniques and simulation speedups
ACM Computing Surveys (CSUR)
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
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Route planning and map inference with global positioning traces
Computer Science in Perspective
Generating node coordinates for shortest-path computations in transportation networks
Journal of Experimental Algorithmics (JEA)
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Efficient models for timetable information in public transportation systems
Journal of Experimental Algorithmics (JEA)
Language constrained graph problems: a microcosm of engineering research and development
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
The Shortcut Problem --- Complexity and Approximation
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An Ant-Based Heuristic for the Railway Traveling Salesman Problem
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Multi-criteria shortest paths in time-dependent train networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Timetable information: models and algorithms
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Finding all attractive train connections by multi-criteria Pareto search
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
The railway traveling salesman problem
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Contraction of timetable networks with realistic transfers
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Partitioning graphs to speed up dijkstra's algorithm
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Algorithm engineering for route planning: an update
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Energy-optimal routes for electric vehicles
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| 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 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.