| Dijkstra算法与旅游路径优化 |
| |
| 引用本文： | 樊守伟,严 艳,张少杰,田泽民.Dijkstra算法与旅游路径优化[J].西安邮电学院学报,2014(1):121-124. |
| |
| 作者姓名： | 樊守伟 严 艳 张少杰 田泽民 |
| |
| 作者单位： | 陕西师范大学旅游与环境学院,陕西西安710062 |
| |
| 基金项目： | 陕西省社会科学基金资助项目（13Q045） |
| |
| 摘 要： | 基于旅游业快速发展的事实,为满足游客省时、省钱、走最短路程的线路需求,对Dijkstra算法加以改进,即先利用Dijkstra算法依次求出局部最优解,然后整合得到全局最优路径,从而使改进算法更适合线路设计。最终在综合考虑旅游花费、交通时间、游览路程3个因素的前提下,以西安市及周边景点为例,设计出3种自驾车旅游最优路径方案,验证了新算法的可行性。
|
| 关 键 词： | Dijkstra算法 自驾游 旅游线路 |
The optimal route design for self-driving travel based on the Dijkstra algorithm |
| |
| FAN Shouwei,YAN Yan,ZHANG Shaojie,TIAN Zemin.The optimal route design for self-driving travel based on the Dijkstra algorithm[J].Journal of Xi'an Institute of Posts and Telecommunications,2014(1):121-124. |
| |
| Authors: | FAN Shouwei YAN Yan ZHANG Shaojie TIAN Zemin |
| |
| Affiliation: | (School of Tourism and Environment, Shaanxi Normal University, Xian 710062, China) |
| |
| Abstract: | An improved scheme based on the Dijkstra algorithm is proposed to meet rapid devel- opment of tourism with high demand from self-travelers on tourism routes design for reduced cost and traffic time as well as the tour distance. This scheme can find out the local optimal path in or- der to achieve the global optimal path. Three optimal paths about self-driving travel in Xi~an giv- en through this scheme are proved to be feasible. |
| |
| Keywords: | Dijkstra algorithm self-driving travel tourism routes |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
