In many algorithms for traffic assignment, the most time-consuming step is shortest path search between all O–D pairs. Almost unnoticed by the transport modeling community, there has been an enormous amount of research on acceleration techniques for the shortest path problem in road networks in the past decade. These techniques usually divide the problem into a relatively expensive preprocessing phase and a significantly accelerated search phase. In this paper, the recently developed customizable contraction hierarchies are used for both shortest path search and network loading in the bi-conjugate Frank–Wolfe algorithm. For the largest test network, this approach achieves a speedup by a factor of 42 compared with a straightforward implementation of Dijkstra’s algorithm.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Accelerating Traffic Assignment with Customizable Contraction Hierarchies


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2020-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



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

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

    Free access

    Customizable traffic zone

    LAU ERIE LAI HAR / SUSANTO HENDRAWAN / HUSSAINI REZA HUSSAIN | European Patent Office | 2022

    Free access

    CUSTOMIZABLE TRAFFIC ZONE

    LAU ERIE LAI HAR / SUSANTO HENDRAWAN / HUSSAINI REZA HUSSAIN | European Patent Office | 2021

    Free access

    Time-Dependent Route Planning with Contraction Hierarchies

    Batz, Gernot Veit Eberhard | DataCite | 2014


    CUSTOMIZABLE TRAFFIC ZONE

    LAU ERIE LAI HAR / SUSANTO HENDRAWAN / HUSSAINI REZA HUSSAIN | European Patent Office | 2022

    Free access