摘要
为了解决传统最短路径算法不能很好地应用于实时公交查询系统的问题,研究了时间依赖的交通网络模型和理论基础,提出了一种时间依赖的最短路径算法,以此算法为基础实现了南京市公交查询系统。实践证明,时间依赖的交通网络模型能更好地反映实际交通网络的运行情况。
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.
出处
《解放军理工大学学报（自然科学版）》
EI
2005年第6期541-544,共4页
Journal of PLA University of Science and Technology(Natural Science Edition)
关键词
时间依赖的交通网络
最短路径算法
网络拓扑
time-dependent
traffic networks shortest path algorithm networks topology
