Customizable Contraction Hierarchies

We consider the problem of quickly computing shortest paths in weighted graphs given auxiliary data derived in an expensive preprocessing phase. By adding a fast weight-customization phase, we extend Contraction Hierarchies [12] to support the three-phase workflow introduced by Delling et al. [6]. Our Customizable Contraction Hierarchies use nested dissection orders as suggested in [3]. We provide an in-depth experimental analysis on large road and game maps that clearly shows that Customizable Contraction Hierarchies are a very practicable solution in scenarios where edge weights often change.