Translator Disclaimer
10 July 2020 Application of Improved Dijkstra Algorithm in Coastal Tourism Route Planning
Author Affiliations +
Abstract

Chen, Y., 2020. Application of improved Dijkstra algorithm in coastal tourism route planning. In: Gong, D.; Zhang, M., and Liu, R. (eds.), Advances in Coastal Research: Engineering, Industry, Economy, and Sustainable Development. Journal of Coastal Research, Special Issue No. 106, pp. 251–254. Coconut Creek (Florida), ISSN 0749-0208.

With the development of computer science and geographic information science, there are more and more applications for GIS. Shortest path analysis is a key issue in GIS geographic network analysis. One of the classical algorithms for calculating the shortest path is the Dijkstra algorithm, which is used in many projects to solve the shortest path problem. However, when the traditional Dijkstra algorithm solves the shortest path between nodes, a large number of nodes outside the identified nodes are calculated, which affects the speed of the algorithm. The Dijkstra algorithm is a classical algorithm for solving the shortest path in the embedded GIS system. By analyzing the Dijkstra algorithm, changing the storage structure, and examining graphing methods, the binary ordering tree algorithm based on the rectangular restricted area reduces the memory storage space. Shortening the query time requires optimizing the shortest path calculation process; the actual data test also shows the effectiveness of the algorithm.

©Coastal Education and Research Foundation, Inc. 2020
Yijing Chen "Application of Improved Dijkstra Algorithm in Coastal Tourism Route Planning," Journal of Coastal Research 106(sp1), 251-254, (10 July 2020). https://doi.org/10.2112/SI106-059.1
Received: 30 November 2019; Accepted: 5 January 2020; Published: 10 July 2020
JOURNAL ARTICLE
4 PAGES


SHARE
ARTICLE IMPACT
RIGHTS & PERMISSIONS
Get copyright permission
Back to Top