Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm

263 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Survey of Autonomous Driving: Common Practices and Emerging Technologies (2019, methodology): “For example, [249] combined a separator with a bounded-hop method and created the Transit Node Routing with Arc Flags (TNR+AF) algorithm.”
Real-time routing with OpenStreetMap data (2011, background): “Bauer et al. investigate combining goal-directed techniques and hierarchy-based methods [1].”
Route Planning in Transportation Networks (2015, methodology): “915 for [37,71] and 1.”
Exact Routing in Large Road Networks Using Contraction Hierarchies (2012, methodology): “Bauer et al. (2010a) show that selecting an optimal node order that minimizes the size of the query search space or the number of short-cuts is NP-hard.”
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks (2011, methodology): “One can combine goal-direction with hierarchical methods or TNR [19, 6, 5].”
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks (2008, background): “The good performance of CHs for (unrolled) transportation networks observed in [9] may be an indicator that this will work well.”
Engineering Route Planning Algorithms (2009, methodology): “Recently, the combination of edge flags with hierarchical approaches has proved very successful [8].”