Contraction hierarchies

<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, the method of contraction hierarchies is a <a href="/facts/Speedup/CyKANbvF">speed-up technique</a> for finding the <a href="/facts/Shortest_path_problem/g4nsrswr">shortest path</a> in a <a href="/facts/Graph_theory/VVPCd4TX">graph</a>. The most intuitive applications are car-navigation systems: a user wants to drive from 
  
    
      
        A
      
    
    {\displaystyle A}
  
 to 
  
    
      
        B
      
    
    {\displaystyle B}
  
 using the quickest possible route. The metric optimized here is the travel time. Intersections are represented by <a href="/facts/Vertex_(graph_theory)/WhlWmL3o">vertices</a>, the road sections connecting them by <a href="/facts/Edge_(graph_theory)/W0MqKkyE">edges</a>. The edge weights represent the time it takes to drive along this segment of the road. A path from 
  
    
      
        A
      
    
    {\displaystyle A}
  
 to 
  
    
      
        B
      
    
    {\displaystyle B}
  
 is a sequence of edges (road sections); the shortest path is the one with the minimal sum of edge weights among all possible paths. The shortest path in a graph can be computed using <a href="/facts/Dijkstra%27s_algorithm/ehun88jl">Dijkstra's algorithm</a> but, given that road networks consist of tens of millions of vertices, this is impractical. Contraction hierarchies is a speed-up method optimized to exploit properties of graphs representing road networks. The speed-up is achieved by creating shortcuts in a preprocessing phase which are then used during a shortest-path query to skip over "unimportant" vertices. This is based on the observation that road networks are highly hierarchical. Some intersections, for example highway junctions, are "more important" and higher up in the hierarchy than for example a junction leading into a dead end. Shortcuts can be used to save the precomputed distance between two important junctions such that the algorithm doesn't have to consider the full path between these junctions at query time. Contraction hierarchies do not know about which roads humans consider "important" (e.g. highways), but they are provided with the graph as input and are able to assign importance to vertices using heuristics.
</p><p>Contraction hierarchies are not only applied to speed-up algorithms in <a href="/facts/Automotive_navigation_system/WKCh5wt8">car-navigation systems</a> but also in web-based <a href="/facts/Journey_planner/gs0hPAzl">route planners</a>, <a href="/facts/Traffic_simulation/hYhTxxUD">traffic simulation</a>, and logistics optimization. Implementations of the algorithm are publicly available as <a href="/facts/Open-source_software/HzTaB8E9">open source software</a>.
</p>

Contraction hierarchies open-in-new

Contraction hierarchies