考虑交叉口延误的城市道路最短路径  

Determination of the Shortest Path Considering Delays at Intersections

作　　者：黄美灵[1] 陆百川[1] 

机构地区：[1]重庆交通大学交通运输学院,重庆400074

出　　处：《重庆交通大学学报（自然科学版）》2009年第6期1060-1063,共4页Journal of Chongqing Jiaotong University(Natural Science)

基　　金：重庆市科技攻关项目(2008AC6074)

摘　　要：在利用G IS建立城市道路网并通过空间分析判断节点方位和路径走向的基础上,提出了一种具有节点阻抗的F loyd算法来解决城市道路网中的最短路径问题,这里直行、左转或右转的分流向延误得到了充分考虑。最后利用所提出的算法对重庆市石桥铺街道路网进行了分析计算,得出了比传统方法更合理的结果。Firstly, the methods that GIS is applied to establish the network of city road and the direction of intersection and path is analyzed by spatial analysis are introduced. Then,the Floyd algorithm considering the delay at intersections is proposed to solve the shortest path problem in the network of city road, in which the delay of traffic flow on each direction, such as going straight, turning left or right is fully taken into consideration. The proposed algorithm is applied to calculate and analyze the road network of Shiqiaopu district in Chongqing,which obtains the more reasonable results than the conventional algorithm does.

关 键 词：城市道路网 最短路径 分流向延误 空间分析 FLOYD算法 

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