Contraction Hierarchies with A* for digital road maps
One of the most successful recent approaches for solving single source - single destination problems in graphs is the Contraction Hierarchies (CH) algorithm, originally published by . The general algorithm consists of two phases: Firstly, a total order on the nodes in the graph is calculated. Secondly for queries, a modified bi-directional Dijkstra-search is performed on the hierarchy implied hereby. Relying on Dijkstra’s algorithm, CH makes no use of the geometric information contained within digital road maps. We propose A*-like modifications of the original query algorithm that double query speed. Results are presented in a benchmark using a map from the OpenStreetMap project.
KeywordsOptimal Path Query Time Forward Search Query Algorithm Bridge Node
Unable to display preview. Download preview PDF.
- 1.BAUER, R., DELLING, D., SANDERS, P., SCHIEFERDECKER,D., SCHULTES, D., ANDWAGNER, D. Combining hierarchical and goal-directed speed-up techniques for dijkstra’s algorithm. ACM Journal of Experimental Algorithmics 2010, 15 (2010).Google Scholar
- 3.GEISBERGER, R., SANDERS, P., SCHULTES, D., AND DELLING, D. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. Proceedings of the 7th Workshop on Experimental Algorithms (WEA’08) 5038 of Lecture Notes in Computer Science (2008), 319–333.Google Scholar
- 4.HAHNE, F. Kürzeste und schnellste Wege in digitalen Straßenkarten (Dissertation). Universität Hildesheim, Hildesheim, 2000.Google Scholar