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.
Shortest Travel Path Searching System Based on Dijkstra Algorithm
AMMASS, International Applied Mechanics, Mechatronics Automation & System Simulation Meeting, 2012 ; 1395-1398
Applied Mechanics and Materials ; 198-199
2012
4 Seiten
Aufsatz (Konferenz)
Englisch
Dıjkstra Algorıthm Usıng Uav Path Plannıng ; Dıjkstra Algoritması Kullanılarak İha Yol Planlaması
BASE | 2020
|Dynamic Shortest-Path Algorithm for Continuous Arc Travel Times
Transportation Research Record | 2008
|Optimal Path Planning of Beidou Navigation System Based on Dijkstra Algorithm
Trans Tech Publications | 2014
|