Design and implementation of shortest travel path searching based on improved Dijkstra algorithm

被引:1
|
作者
Mo, Taiping [1 ]
Zhao, Huihuang [2 ]
Mo, Wei [3 ]
机构
[1] Xidian Univ, Dept Mech & Elect Engn, Xidian 710126, Shanxi, Peoples R China
[2] Hengyang Normal Univ, Dept Comp Sci, Hunan 421008, Peoples R China
[3] Guilin Univ Elect Technol, Dept Elect Engn & Automat, Guangxi 541004, Peoples R China
关键词
Shortest path; Dijkstra algorithm; Tourism path search; Algorithm design;
D O I
10.4028/www.scientific.net/AMM.157-158.390
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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 improve the disadvantage of tradition Dijkstra algorithm, an improve algorithm was proposed to improve the path search efficiency. Then the improved Dijkstra algorithm was applied to tourism path search. The experimental results have illustrated that the improved Dijkstra algorithm can accomplish a better result and improve path search efficiency.
引用
收藏
页码:390 / +
页数:3
相关论文
共 50 条
  • [1] Optimal Path Searching Method based on Improved Dijkstra Algorithm
    Ma, Hui
    Zhou, Zhizheng
    Zhou, Zhizheng
    Liu, Guangyan
    [J]. EPLWW3S 2011: 2011 INTERNATIONAL CONFERENCE ON ECOLOGICAL PROTECTION OF LAKES-WETLANDS-WATERSHED AND APPLICATION OF 3S TECHNOLOGY, VOL 3, 2011, : 567 - 570
  • [2] An Improvement of the Shortest Path Algorithm Based on Dijkstra Algorithm
    Xiao, Ji-Xian
    Lu, Fang-Ling
    [J]. 2010 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING (ICCAE 2010), VOL 2, 2010, : 383 - 385
  • [3] The Improved Dijkstra's Shortest Path Algorithm and Its Application
    Wang Shu-Xi
    [J]. 2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 1186 - 1190
  • [4] An improved Dijkstra's shortest path algorithm for sparse network
    Xu, M. H.
    Liu, Y. Q.
    Huang, Q. L.
    Zhang, Y. X.
    Luan, G. F.
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 185 (01) : 247 - 254
  • [5] Optimization Strategy Based on Shortest Path Algorithm of Dijkstra
    Jiang, Xiaoke
    Fan, Hongjun
    Kang, Dong
    [J]. 2ND INTERNATIONAL CONFERENCE ON COMMUNICATION AND TECHNOLOGY (ICCT 2015), 2015, : 78 - 82
  • [7] An Improved Shortest Path Algorithm Based on Orientation Rectangle for Restricted Searching Area
    Zhou, Wenyan
    Qiu, Qizhi
    Luo, Peng
    Fang, Pei
    [J]. PROCEEDINGS OF THE 2013 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN (CSCWD), 2013, : 692 - 697
  • [8] An Algorithm of Searching for the Shortest Path
    Hu, Ji-Bing
    Zhang, Jin-Cheng
    Liu, Lin-Yuan
    [J]. PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATION AND SENSOR NETWORKS (WCSN 2016), 2016, 44 : 721 - 725
  • [9] A parallelization of Dijkstra's shortest path algorithm
    Crauser, A
    Mehlhorn, K
    Meyer, U
    Sanders, P
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 722 - 731
  • [10] Analysis of the Shortest Repaired Path of Distribution Network Based on Dijkstra Algorithm
    Hu, Yi
    Chang, Zhiying
    Sun, Liying
    Wang, Yi
    [J]. ICEET: 2009 INTERNATIONAL CONFERENCE ON ENERGY AND ENVIRONMENT TECHNOLOGY, VOL 2, PROCEEDINGS, 2009, : 73 - 76