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 条
  • [31] Shortest Tool Path Generation Method for STEP-NC Complex Pockets Based on Graph Theory and Improved Dijkstra Algorithm
    Zhang, Yu
    Li, Dong-Sheng
    Wang, Zhi-Wei
    Gong, Ya-Dong
    [J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2020, 41 (09): : 1285 - 1290
  • [32] 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
  • [33] Extending Dijkstra's Shortest Path Algorithm for Software Defined Networking
    Jiang, Jehn-Ruey
    Huang, Hsin-Wen
    Liao, Ji-Hau
    Chen, Szu-Yuan
    [J]. 2014 16TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS), 2014,
  • [34] On the Applications of Dijkstra's Shortest Path Algorithm in Software Defined Networks
    Grbac, Tihana Galinac
    Domazet, Nikola
    [J]. INTELLIGENT DISTRIBUTED COMPUTING XI, 2018, 737 : 39 - 45
  • [35] Research on the Shortest Path Problem Based on Improved Genetic Algorithm
    Wang, Baoliang
    Yao, Susu
    Lu, Kaining
    Zhao, Huizhen
    [J]. HUMAN CENTERED COMPUTING, HCC 2017, 2018, 10745 : 173 - 182
  • [36] A shortest path algorithm of long-period cyclic fully connected layer graph based on Dijkstra algorithm
    Mi, Shanghua
    Ji, Zengwei
    Zheng, Hao
    Gao, Yicong
    [J]. 2020 INTERNATIONAL CONFERENCE ON ADVANCED MECHATRONIC SYSTEMS (ICAMECHS), 2020, : 323 - 327
  • [37] Parallel implementation of the shortest path algorithm on FPGA
    Fernandez, Ivan
    Castillo, Javier
    Pedraza, Cesar
    Sanchez, Carlos
    Ignacio Martinez, Jose
    [J]. 2008 4TH SOUTHERN CONFERENCE ON PROGRAMMABLE LOGIC, PROCEEDINGS, 2008, : 245 - 248
  • [38] Combining turning point detection and Dijkstra's algorithm to search the shortest path
    Wu, Ter-Feng
    Tsai, Pu-Sheng
    Hu, Nien-Tsu
    Chen, Jen-Yang
    [J]. ADVANCES IN MECHANICAL ENGINEERING, 2017, 9 (02):
  • [39] Application of Dijkstra Algorithm for Solving Interval Valued Neutrosophic Shortest Path Problem
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    [J]. PROCEEDINGS OF 2016 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2016,
  • [40] Design and Implementation of a Novel Weighted Shortest Path Algorithm for Maze Solving Robots
    Rahnama, Behnam
    Ozdemir, Makbule Canan
    Kiran, Yunus
    Elci, Atilla
    [J]. 2013 IEEE 37TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS (COMPSACW), 2013, : 328 - 332
12345