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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Dijkstra-Based Dynamic Algorithm for Strongest Road Capacity


    Beteiligte:
    Long, Teng (Autor:in) / Sun, Bo (Autor:in) / Yang, Qingxia (Autor:in) / Long, Guangtao (Autor:in)

    Kongress:

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


    Erschienen in:

    CICTP 2017 ; 2725-2730


    Erscheinungsdatum :

    18.01.2018




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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

    Freier Zugriff

    AIS Based Shipping Routes Using the Dijkstra Algorithm

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

    Freier Zugriff

    Shortest Travel Path Searching System Based on Dijkstra Algorithm

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


    EV load prediction method based on dynamic weighting Dijkstra

    BING SHENGWEI / BIAN HAIHONG / REN QUANCE | Europäisches Patentamt | 2023

    Freier Zugriff

    Research on Railway Transportation Route Based on Dijkstra Algorithm

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