道路交通网络最短路径关键转向研究  

Research on the Critical Turn of Shortest Paths in Urban Road Network

作　　者：高明霞[1] GAO Ming-xia(School of Traffic and Transportation,Lanzhou Jiaotong University,Lanzhou 730070,China)

机构地区：[1]兰州交通大学交通运输学院

出　　处：《公路》2018年第9期199-202,共4页Highway

基　　金：国家自然科学基金项目,项目编号71661021,61563028

摘　　要：研究道路网络中的最短路径关键转向问题,以便于分析某些交叉口转向一旦被限制或由于严重堵塞无法通行时,对OD间最佳行驶路线的影响。将城市道路网抽象为节点具有方向性权重的有向赋权网络,给出了该类网络中最短路径关键转向的定义,对经典Dijkstra算法进行改进,采用给弧标号的方式,设计了在该类网络中寻找最短路径及其关键转向的有效算法。最后通过一个实例进行了分析。The problem of critical direction-turning of shortest paths is studied to analyze the impact on the shortest paths between OD pairs when turning at some directions at the intersection is prohibited or cannot work because of severe traffic congestion.After describing an urban road network as a directed network with directional weight at nodes,the critical turning direction of shortest paths in such network is defined and an algorithm is proposed.To handle the directed weight at nodes,the classical Dijkstra algorithm is modified by using arc labels,and an effective algorithm is designed which can find the shortest path and its critical turn in the network.Finally analysis is made through verifications to an example.

关 键 词：智能运输系统 关键转向 改进DIJKSTRA算法 最短路径 方向性点权网络 

分 类 号：U491.111[交通运输工程—交通运输规划与管理]