|
|||||
|
|
| 最短路径算法用于城市公交出行路径最优化 | |
| 引用本文： | 张淑娟,浮寸萍,金淑英. 最短路径算法用于城市公交出行路径最优化[J]. 现代测绘, 2006, 29(4): 37-39,44 |
| 作者姓名： | 张淑娟 浮寸萍 金淑英 |
| 作者单位： | 1. 武汉大学资源与环境学院,湖北,武汉,430079 2. 南京市测绘勘察研究院有限公司,江苏,南京,210005 3. 武汉大学测绘遥感信息工程国家重点实验室,湖北,武汉,430079 |
| 摘 要： | 介绍了经典Dijk st ra算法的主要思想快速实现方法，指出了公交网络不同于一般的道路网络的特点，给出了选择公交出行路径的算法思想。 |
| 关 键 词： | 最短路径 城市道路 网络 最优化 |
| 文章编号： | 1672-4097（2006）04-0037-04 |
The Application of the Shortest Path Algorithm in the Research of the Best Way of City Bus |
|
| Zhang Shujuan,Fu Cunping,Jin Shuying. The Application of the Shortest Path Algorithm in the Research of the Best Way of City Bus[J]. Modern Surveying and Mapping, 2006, 29(4): 37-39,44 | |
| Authors: | Zhang Shujuan Fu Cunping Jin Shuying |
| Affiliation: | 1 .School of Resource and Environment of Wuhan university, No. 129 in Luoyu road, Wuhan 430079;2. Survey and Mapping Exploration Institute co., ltd., Nanjing 21005; 3 .National Laboratory for Information Engineering in Surveying, Mapping and Remote Sensing of Wuhan University, No. 129 in Luoyu road 430079 |
| Abstract: | This paper introduces the method of realizing quickly Dijkstra algorithm, explores the different feathers from common road net and gives the algorithm of selecting bus. |
| Keywords: | The shortest way City road Net The best way |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |