| 交通网络中最短路径算法分析与探讨 |
| |
| 引用本文： | 许志海,魏峰远. 交通网络中最短路径算法分析与探讨[J]. 焦作工学院学报, 2005, 0(1) |
| |
| 作者姓名： | 许志海 魏峰远 |
| |
| 作者单位： | 信息工程大学测绘学院 河南郑州 450052(许志海)，河南理工大学 河南焦作 454003(魏峰远) |
| |
| 摘 要： | 通过对交通网络本身特点的分析与研究,介绍了一些适合道路网的经典最短路径算法和数据存贮模式,探讨了在交通网络路线优化过程中需要特别处理的几个问题,如路口延误、禁行状态等,在理论上给出了相应的解决方案,并提出了一个路径搜索的实例.
|
| 关 键 词： | 交通网络 最短路径 Dijstra算法 启发式搜索 交通信息 |
Analysis of shortest path algorithms for transportation networks |
| |
| XU Zhi_hai,WEI Feng_yuan. Analysis of shortest path algorithms for transportation networks[J]. Journal of Jiaozuo Institute of Technology(Natural Science), 2005, 0(1) |
| |
| Authors: | XU Zhi_hai WEI Feng_yuan |
| |
| Affiliation: | XU Zhi_hai~1,WEI Feng_yuan~2 |
| |
| Abstract: | According to characteristics of the transportation networks, some classical shortest path algorithms and data storage model suitable for road networks are introduced, and several special problems which need to be treated in the routing planning for the arteries of communication, such as the intersection delay and the forbidden state in road networks, are discussed, and the corresponding solutions are given theoretically. Finally, a path search example is given. |
| |
| Keywords: | transportation network shortest path Dijstra algorithm heuristic search traffic information |
| 本文献已被 CNKI 等数据库收录！ |
|
