运输网络最短路径关键点问题研究

Study on Vital Nodes of the Shortest Paths in Transportation Networks

运输网络最短路径的计算是交通规划和运输组织主要研究问题之一。实际生产中,因运输组织不当或车辆调度不当,造成运输网络堵塞的现象时有发生。本文就运输网络最短路的两类关键点给出了定义,并分别提出了基于连通最短路子树的求解关键点的算法。对分析运输薄弱环节、加强交通瓶颈通过能力提供了科学的量化手段,并对兰州市某城区做了实例分析。

Finding the shortest paths in a traffic and transportation network is one of the main research subjects in traffic planning and transportation organizing. Blocking of traffic networks is often caused in practices when improper organization or dispatching happens in transportation. In this paper are given the definitions of two types of vital nodes of the shortest paths in a, traffic network and the algorithms based on connecting shortest paths sub trees for finding vital nodes. This provides a scientific quantitative method for decision makers to analyse weak points of transportation and enhance bottleneck passing capacity in a transportation network. Finally, case study is made for the traffic in an urban area of Lanzhou.