摘要
以往最短路径的定义及其算法只考虑路段上的走行时间 ,没有考虑节点的延误 ,这对城市道路网是不适合的 .用相邻节点向量描述了节点的相对方位 ,定义了次步节点的概念 ,给出了不同流向车流延误的数学表达 ,在此基础上重新定义了道路网的最短路径 ,并探讨了它的算法 .
The former definition of the shortest path only included the cost on links,but did not include the cost at nodes.That is unsuitable for urban road network.In this paper,the relative position of nodes is depicted with vector of neighboring nodes,and the `next-step node'is defined.Then the delay of traffic flow on each direction at intersection is expressed.At last,the conception of the shortest path is anew given,and its algorithm is researched.
出处
《同济大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2002年第1期52-56,共5页
Journal of Tongji University:Natural Science
基金
国家自然科学基金资助项目 ( 70 0 710 18)
