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.
Time-Dependent Route Planning with Contraction Hierarchies
2014
Miscellaneous
Electronic Resource
English
Accelerating Traffic Assignment with Customizable Contraction Hierarchies
Transportation Research Record | 2020
|Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies
DataCite | 2018
|Exact Routing in Large Road Networks Using Contraction Hierarchies
British Library Online Contents | 2012
|Exact Routing in Large Road Networks Using Contraction Hierarchies
Online Contents | 2012
|EGO TRAJECTORY PLANNING WITH RULE HIERARCHIES FOR AUTONOMOUS VEHICLES
European Patent Office | 2024
|