| 时间依赖的交通网络模型及最短路径算法 |
| |
| 引用本文： | 何俊,戴浩,宋自林,刘刚.时间依赖的交通网络模型及最短路径算法[J].解放军理工大学学报,2005,6(6):541-544. |
| |
| 作者姓名： | 何俊 戴浩 宋自林 刘刚 |
| |
| 作者单位： | 解放军理工大学,指挥自动化学院,江苏,南京,210007;解放军通信指挥学院,湖北,武汉430010;中国电子设备系统工程公司,北京,100039;解放军理工大学,指挥自动化学院,江苏,南京,210007;解放军通信指挥学院,湖北,武汉430010 |
| |
| 摘 要： | 为了解决传统最短路径算法不能很好地应用于实时公交查询系统的问题，研究了时间依赖的交通网络模型和理论基础，提出了一种时间依赖的最短路径算法，以此算法为基础实现了南京市公交查询系统。实践证明，时间依赖的交通网络模型能更好地反映实际交通网络的运行情况。
|
| 关 键 词： | 时间依赖的交通网络 最短路径算法 网络拓扑 |
| 文章编号： | 1009-3443(2005)06-0541-04 |
| 收稿时间： | 2004-11-22 |
| 修稿时间： | 2004年11月22 |
Time-dependent traffic networks model and shortest path algorithm |
| |
| HE Jun,DAI Hao,SONG Zi-lin and LIU Gang.Time-dependent traffic networks model and shortest path algorithm[J].Journal of PLA University of Science and Technology(Natural Science Edition),2005,6(6):541-544. |
| |
| Authors: | HE Jun DAI Hao SONG Zi-lin and LIU Gang |
| |
| Institution: | Institute of Command Automation,PLA Univ.of Sci.& Tech., Nanjing 210007,China;Institute of Communication and Command of PLA,Wuhan 430010,China;Institute of China Electronic System Engineering Corporation,Beijing 100039,China;Institute of Command Automation,PLA Univ.of Sci.& Tech., Nanjing 210007,China;Institute of Communication and Command of PLA,Wuhan 430010,China |
| |
| Abstract: | Classic shortest path algorithms brought some questions when applied to timed bus query system. Emphases of research were laid on the time-dependent traffic networks and their basic theory in this paper. A time-dependent shortest path algorithm was presented and a bus query system in Nanjing based on this shortest path algorithm was realized. Experimental results demonstrate that the time-dependent traffic networks can well describe how actual traffic networks run. |
| |
| Keywords: | time-dependent traffic networks shortest path algorithm networks topology |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《解放军理工大学学报》浏览原始摘要信息 |
| 点击此处可从《解放军理工大学学报》下载免费的PDF全文 |
|
