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

摘要：

The existing transportation service system in public travel route can not satisfy the peoples 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.

关键词： Shortest path Dijkstra algorithm Tourism path search Algorithm design

作者: Taiping Mo Huihuang Zhao Wei Mo

作者单位: Department of Mechanical & Electrical Engineering, Xidian University, Shanxi 710126, China Department of Computer Science, Hengyang Normal University, Hunan 421008, China Department of Electronic Engineering & Automation, Guilin University of Electronic Technology,Guangx

会议类型: 国际会议

会议名称: 2011 International Conference on Mechatronics and Applied Mechanics(2011年机电一体化与应用力学国际会议 ICMAM 2011)

会议地点: 香港

会议语种:英文

页码: 390-394

在线出版日期: 2011-12-27（万方平台首次上网日期，不代表论文的发表时间）