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

@article{Bauer2010CombiningHA,
  title={Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm},
  author={R. Bauer and D. Delling and P. Sanders and Dennis Schieferdecker and Dominik Schultes and D. Wagner},
  journal={ACM J. Exp. Algorithmics},
  year={2010},
  volume={15}
}
  • R. Bauer, D. Delling, +3 authors D. Wagner
  • Published 2010
  • Computer Science
  • ACM J. Exp. Algorithmics
  • In recent years, highly effective hierarchical and goal-directed speed-up techniques for routing in large road networks have been developed. This article makes a systematic study of combinations of such techniques. These combinations turn out to give the best results in many scenarios, including graphs for unit disk graphs, grid networks, and time-expanded timetables. Besides these quantitative results, we obtain general insights for successful combinations. 
    192 Citations

    Figures, Tables, and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Core Routing on Dynamic Time-Dependent Road Networks
    • 37
    • PDF
    Combining the Connection Scan Algorithm with Contraction Hierarchies
    • PDF
    Contraction Hierarchies on Grid Graphs
    • 17
    • PDF
    Candidate Sets for Alternative Routes in Road Networks
    • 46
    • PDF
    Engineering Route Planning Algorithms
    • 452
    • PDF
    Optimizing Landmark-Based Routing and Preprocessing
    • 26
    • PDF
    Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
    • 9
    • PDF
    Customizable Route Planning
    • 162
    • PDF

    References

    SHOWING 1-9 OF 9 REFERENCES
    Combining Speed-Up Techniques for Shortest-Path Computations
    • 41
    • Highly Influential
    Better Landmarks Within Reach
    • 77
    • Highly Influential
    • PDF
    Reach for A*: Shortest Path Algorithms with Preprocessing
    • 67
    • Highly Influential
    • PDF
    Fast Point-to-Point Shortest Path Computations with Arc-Flags
    • 171
    • Highly Influential
    • PDF
    Proceedings of the 9th DIMACS Implementation Challenge—Shortest Paths
    • American Mathematical Society, Providence, RI.
    • 2006
    Accelerating Point-to-Point Shortest Path Computations in Large Scale Networks
    • Master ’ s thesis
    • 2007
    SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Parti- tioning, and Parallel and Sequential Sparse Matrix Ordering Package
    • CHASE gen 3.1
    • 2007
    SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partition- ing, and Parallel and Sequential Sparse Matrix Ordering Package
    • CHASE gen 3.1
    • 2007
    SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix
    • Ordering Package,
    • 2007