重大灾害条件下基于GIS的最短路径改进算法.pdfVIP

第11 卷 第4 期 交 通 运 输 工 程 学 报 Vol11 No4 2011 年8 月 Journal of Traffic and T ransportation Engineering Aug . 2011 : 16 1163 ( 2011) GIS 1 1 1, 2 于德新 , 杨 薇 , 杨兆升 ( 1 , 130022; 2 , 130022) : 利用经典的Dijkstra 算法, 对重大灾 条件下Dijkstra 算法进行了改进, 构建了惩罚因子 函数, 结合GIS 软件二次开发模块, 通过Visual C+ + 60 实现了复杂网络的分析功能分析了重 大灾 条件下节点数量对于道路可靠性以及最优路径选取的影响, 综合考虑距离行程时间以及节 点数量因素, 证明了改进Dijkstra 算法对于最优路径选择的优越性分析结果表明: 利用改进 Dijkstra算法经典Dijkstra 算法计算出的路径节点数分别为3159, 行程时间基本相同可见, 改 进算法能有效减少疏散路径中的节点数量, 降低车辆在节点处的延误损失和风险 : 最短路径; Dijkstra 算法; 惩罚因子; 可靠性分析 : U 491. 1 : A Shortest path improved algorithm based on GIS under largescale disaster 1 1 1, 2 YU Dexin , YANG Wei , YANG Zhaosheng ( 1. School of Traffic, Jilin University, Changchun 130022, Jilin, China; 2. St ate Key Laboratory of Automot ive Simulat ion and Control, Jilin University , Changchun 130022, Jilin, China) Abstract: T he Dijkstra algorithm under largescale disaster w as improved by using classical Dijkstra algorithm, and the function of penalty factor w as built. Complex netw ork analysis function w as realized by using Visual C+ + 6. 0 and the secondary development module of GIS. The impacts of node quantity on road reliability and the selection of optimal path under largescale disaster w ere analyzed. Distance, travel time and node quantity w ere considered, the advantage of improved Dijkstra algorithm in the selection of optimal path w as proved. A nalysis result show s that the node quantities computed by improved Dijkstra algorithm and classical Dijkstra algorithm are 31, 59 respectively , travel times are almost same. So