Shortest Travel Path Searching System Based on Dijkstra Algorithm

Abstract:

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.

• Periodical: Applied Mechanics and Materials (Volumes 198-199)
• Pages: 1395-1398
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.198-199.1395
• Online since: September 2012
• Authors: Ya Qi Sun, Yu Liu, Kuo Hua Xiao
• Keywords: Dijkstra Algorithm, Shortest Path, Travel Path Searching System

References

[1] E.W. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik, 1959. 1269-271.

[2] A. Aggarwal, B. Schieber, and T. Tokuyama. Finding a minimum weight K-link path in graphs with Monge property and applications. Proc. 9th Symp. Computational Geometry, Assoc. for Computing Machinery, 1993. 189–197.

DOI: 10.1145/160985.161135

[3] D. Wagner and T. Willhalm. Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In European Symposium on Algorithms, (2003).

DOI: 10.1007/978-3-540-39658-1_69

[4] Fang Hui, Hong Weijun, Shortest Path Algorithm within Dynamic Restricted Searching Area in City Emergency Rescue[J], Journal of Chinese People's Public Security University(Science and Technology), 2010. 4(4): 87-91.

DOI: 10.1109/icemms.2010.5563425

[5] Fang MeiHong, Liu ShaoHua. The Design and Realization of the shortest path Algorithm Based on VC++. [J] Urban Geotechnical investigation & surveying, 2008. 1: 43-46.

[6] Lin X, Shroff N B. Utility maximization for communication networks with multi-path routing[C]. IEEE Trans Automat Contr, 2006: 766-781.

DOI: 10.1109/tac.2006.875032

[7] S. Xing, C. Shahabi, and B. Pan. Continuous monitoring of nearest neighbors on land surface. PVLDB, 2(1): 1114–1125, (2009).

DOI: 10.14778/1687627.1687753

[8] ZHANG Jin-ming, HONG Gang, WEN Rui, et al. Optimization strategies of the Dijkstra's shortest route algorithm[J]. Science of Surveying and Mapping, 2009, 34(5): 105-106.

[9] CAO Jiandong, ZHENG Sifa，WANG Jianqiang, et al. Fast synchronous optimization algorithm for pickup and delivery route[J]. Journal of Tsinghua University (Science and Technology), 2008, 48 (8) : 1344-1347.

[10] Zhang Fuhao, Liu Jiping. A new shortest path algorithm for massive spatial data based on Dijkstra algorithm[J]. Journal of LiaoNing Technology University: (Natural Science and edition), 2009, 28(4): 554-557.

DOI: 10.1109/fskd.2009.848