Dijkstra algorithm solves classic shortest path problems. However, in practice, the existence of a number of restrictions requires the algorithm to be improved and optimized. In real traffic problems, an improved algorithm is proposed based on the analysis of classical Dijkstra algorithm. Based on actual traffic flow and congestion data, different congestion coefficients are given to different routes in traffic network, and an improved algorithm is utilized to obtain the optimal path of traffic capacity for a concrete example. This algorithm is implemented in C program language.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dijkstra-Based Dynamic Algorithm for Strongest Road Capacity


    Contributors:
    Long, Teng (author) / Sun, Bo (author) / Yang, Qingxia (author) / Long, Guangtao (author)

    Conference:

    17th COTA International Conference of Transportation Professionals ; 2017 ; Shanghai, China


    Published in:

    CICTP 2017 ; 2725-2730


    Publication date :

    2018-01-18




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Dıjkstra Algorıthm Usıng Uav Path Plannıng ; Dıjkstra Algoritması Kullanılarak İha Yol Planlaması

    Dhulkefl, Elaf / Durdu, Akif / Terzi̇oğlu, Hakan | BASE | 2020

    Free access

    AIS Based Shipping Routes Using the Dijkstra Algorithm

    Pedro Silveira / Ângelo Palos Teixeira / Carlos Guedes Soares | DOAJ | 2019

    Free access

    Shortest Travel Path Searching System Based on Dijkstra Algorithm

    Sun, Ya-Qi / Liu, Yu / Xiao, Kuo-Hua | Tema Archive | 2012


    Research on Railway Transportation Route Based on Dijkstra Algorithm

    Di, Junhui / Gao, Ruhu | Springer Verlag | 2022


    EV load prediction method based on dynamic weighting Dijkstra

    BING SHENGWEI / BIAN HAIHONG / REN QUANCE | European Patent Office | 2023

    Free access