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.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Time-Dependent Route Planning with Contraction Hierarchies


    Beteiligte:

    Erscheinungsdatum :

    2014



    Medientyp :

    Sonstige


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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

    Freier Zugriff

    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. | Europäisches Patentamt | 2024

    Freier Zugriff