Time-Dependent Route Planning with Contraction Hierarchies

Design and experimental evaluation of route planning algorithms for time-dependent road networks, which model regular effects like congestions. By generalizing contraction hierarchies, we achieve fast and space efficient computation of minimum travel time routes and profiles. We also consider additional constant costs (e.g., to penalize detours and motorway tolls), which makes route planning NP-hard. Then, routes become heuristic, but we get quite near to the optimum as experiments show