Route planning for bicycles - Exact constrained shortest paths made practical via contraction hierarchy

Abstract

We consider the problem of computing shortest paths subject to an additional resource constraint such as a hard limit on the (positive) height difference of the path. This is typically of interest in the context of bicycle route planning, or when energy consumption is to be limited. So far, the exact computation of such constrained shortest paths was not feasible on large networks; we show that state-of-the-art speed-up techniques for the shortest path problem, like contraction hierarchies, can be instrumented to solve this problem efficiently in practice despite the NP-hardness in general. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.