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.


    Access

    Download

    Check availability in my library


    Export, share and cite



    Title :

    Time-Dependent Route Planning with Contraction Hierarchies


    Contributors:

    Publication date :

    2014



    Type of media :

    Miscellaneous


    Type of material :

    Electronic Resource


    Language :

    English




    Accelerating Traffic Assignment with Customizable Contraction Hierarchies

    Schneck, Arne / Nökel, Klaus | Transportation Research Record | 2020


    Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies

    Buchhold, Valentin / Sanders, Peter / Wagner, Dorothea | DataCite | 2018

    Free access

    Exact Routing in Large Road Networks Using Contraction Hierarchies

    Geisberger, R. / Sanders, P. / Schultes, D. et al. | British Library Online Contents | 2012



    EGO TRAJECTORY PLANNING WITH RULE HIERARCHIES FOR AUTONOMOUS VEHICLES

    VEER SUSHANT / LEUNG KAREN / COSNER RYAN et al. | European Patent Office | 2024

    Free access