This paper presents an improved Dijkstra algorithm considering turn delays at intersections and establishes a UE traffic assignment algorithm based on the improved shortest path algorithm. The improved shortest algorithm identifies the turn delay by recording the previous node of each node in the path iteration process. And the time complexity of this algorithm is optimized from O(n2) to O(n log n) through heap optimization. A MATLAB program is realized and is validated through a real urban road network in Xi’an. The result shows (1) the shortest path algorithm used in this paper can sensitively identify intersection delays; considering turn delay in the shortest algorithm is more realistic; and (2) considering the intersection delay in the traffic assignment will not affect convergence performance too much. Moreover, the traffic assignment results may change when turn delays are considered.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Research on Influence of Considering Turn Delays in Shortest Path Problems on Traffic Assignment


    Beteiligte:
    He, Qiang (Autor:in)

    Kongress:

    20th COTA International Conference of Transportation Professionals ; 2020 ; Xi’an, China (Conference Cancelled)


    Erschienen in:

    CICTP 2020 ; 2661-2668


    Erscheinungsdatum :

    09.12.2020




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Traffic assignment by shortest path method using TD factor

    Benesh, A.H. | Engineering Index Backfile | 1967




    Evaluation of Shortest Path Algorithms in a Distributed Traffic Assignment Environment

    Kriesten, R. / Kiencke, U. / Society of Automotive Engineers | British Library Conference Proceedings | 2003


    Evaluation of Shortest Path Algorithms in a Distributed Traffic Assignment Environment

    Kriesten, Reiner / Kiencke, Uwe | SAE Technical Papers | 2003