Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Journal of Discrete Algorithms
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Evaluating dynamic dispatch strategies for emergency medical services: TIFAR simulation tool
Proceedings of the Winter Simulation Conference
| Hi-index | 0.01 |
The computation of shortest paths between different locations on a road network appears to be a key problem in many applications. Often, a shortest path is required in a very short time. In this article, we try to find an answer to the question of which shortest path algorithm for the one-to-one shortest path problem runs fastest on a large real-road network. An extensive computational study is presented, in which six existing algorithms and a new label correcting algorithm are implemented in several variants and compared on the real-road network of The Netherlands. In total, 168 versions are implemented, of which 18 versions are variants of the new algorithm and 60 versions are new by the application of bidirectional search. In the first part of the article we present a mathematical framework and a review of existing algorithms. We then describe combinations of existing algorithms with bidirectional search and heuristic-estimate techniques based on Euclidean distance and landmarks. We also present some useful static reduction techniques. In the final part of the article we present results from computational tests on The Netherlands road network. The new algorithm, which combines concepts from previous work on buckets and label-correcting techniques, has generally the shortest running times of any of the tested algorithms. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(4), 182–194 2006This research is part of a Ph.D. project of the second author and a Master's project of the first author, at Delft University of Technology, Department of Electrical Engineering, Mathematics and Computer Science.