The existing transportation service system in public travel route can not satisfy the people's actual travel need because of various technologies reasons. In our study, we set the tourist attractions as a vertex, and simplified the traditional algorithm for complex network computing. Aim to use the advantage of Dijkstra algorithm, the Dijkstra algorithm was applied to tourism path search. The experimental results have illustrated that the Dijkstra algorithm can accomplish a good result in search efficiency.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Shortest Travel Path Searching System Based on Dijkstra Algorithm


    Beteiligte:
    Sun, Ya-Qi (Autor:in) / Liu, Yu (Autor:in) / Xiao, Kuo-Hua (Autor:in)


    Erscheinungsdatum :

    2012


    Format / Umfang :

    4 Seiten




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    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


    Dynamic Shortest-Path Algorithm for Continuous Arc Travel Times

    Hu, Jian / Chan, Yupo | Transportation Research Record | 2008


    Optimal Path Planning of Beidou Navigation System Based on Dijkstra Algorithm

    Wu, Shao Kai ;Zhang, Jing Lei | Trans Tech Publications | 2014