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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Shortest Travel Path Searching System Based on Dijkstra Algorithm


    Contributors:
    Sun, Ya-Qi (author) / Liu, Yu (author) / Xiao, Kuo-Hua (author)


    Publication date :

    2012


    Size :

    4 Seiten




    Type of media :

    Conference paper


    Type of material :

    Print


    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


    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