摘要
针对城市交通网络的复杂性,构建了一个最优路径计算模型,在此模型基础上提出了最优路径搜索的树修剪算法。并根据实际测得的交通数据,验证了该算法。
With consideration of the complexity of urban transportation, this papar constructs a model for the computation of shortest path and presents a tree pruned algorithm on the basis of this model. At the end of the paper, we give proof to this algorithm based on the collected transportation data.
出处
《交通与计算机》
2003年第5期59-61,共3页
Computer and Communications
关键词
城市交通网络
最优路径搜索
树修剪算法
节点用时
路段用时
模型
shortest path
the theorem of shortest path
urban transportation network
tree pruned algorithm
time on node
time on road
