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
来源：
MECHATRONICS AND APPLIED MECHANICS, PTS 1 AND 2 | 2012年 / 157-158卷
关键词：
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 条
  • [21] A THEOREM ON THE EXPECTED COMPLEXITY OF DIJKSTRA SHORTEST-PATH ALGORITHM
    NOSHITA, K
    [J]. JOURNAL OF ALGORITHMS, 1985, 6 (03) : 400 - 408
  • [22] Micro crack detection with Dijkstra’s shortest path algorithm
    Christina Gunkel
    Alexander Stepper
    Arne C. Müller
    Christine H. Müller
    [J]. Machine Vision and Applications, 2012, 23 : 589 - 601
  • [23] Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    Vladareanu, Luige
    [J]. 2016 INTERNATIONAL CONFERENCE ON ADVANCED MECHATRONIC SYSTEMS (ICAMECHS), 2016, : 412 - 416
  • [24] Shortest Path Evaluation with Enhanced Linear Graph and Dijkstra Algorithm
    Dudi, Tanishk
    Singhal, Rahul
    Kumar, Rajesh
    [J]. 2020 59TH ANNUAL CONFERENCE OF THE SOCIETY OF INSTRUMENT AND CONTROL ENGINEERS OF JAPAN (SICE), 2020, : 451 - 456
  • [25] Micro crack detection with Dijkstra's shortest path algorithm
    Gunkel, Christina
    Stepper, Alexander
    Mueller, Arne C.
    Mueller, Christine H.
    [J]. MACHINE VISION AND APPLICATIONS, 2012, 23 (03) : 589 - 601
  • [26] An Improved Genetic Algorithm Based on the Shortest Path Problem
    Liu, Zhendong
    Kong, Yawei
    Su, Bin
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION (ICIA), 2016, : 328 - 332
  • [27] An Improved Multiobjective Shortest Path Algorithm
    de las Casas, Pedro Maristany
    Sedeno-Noda, Antonio
    Borndoerfer, Ralf
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 135
  • [28] Design and Implementation of Bidirectional Dijkstra Algorithm
    付梦印
    李杰
    周培德
    [J]. Journal of Beijing Institute of Technology, 2003, (04) : 366 - 370
  • [29] A dynamic shortest path algorithm based on an improved ant colony algorithm
    Zhang, S. J.
    [J]. 2018 INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SCIENCE AND APPLICATION TECHNOLOGY, 2019, 1168
  • [30] A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
    Peyer, Sven
    Rautenbach, Dieter
    Vygen, Jens
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 377 - 390
12345