公路交通拥塞路径规划设计仿真  

The Design and Simulation of Congestion Avoidance Algorithm in Transportation Path Planning

作　　者：杜学风 李晓卉[1] 张尉 丁月民 DU Xue-feng;LI Xiao-hui;ZHANG Wei;DING Yue-min(College of Information Science and Engineering, Wuhan University of Science and Technology, WuhanHubei 430081;Wuhan Institute of Agricultural Mechanization Sciences, Academy of Agricultural Science and Technology, Wuhan Hubei 430345;College of Computer and Communication Engineering, Tianjin University of Technology, Tianjin 300384, China)

机构地区：[1]武汉科技大学信息科学与工程学院.湖北武汉430081 [2]武汉市农业科学技术研究院农业机械化科学研究所,湖北武汉430345 [3]天津理工大学计算机与通信工程学院,天津300384

出　　处：《计算机仿真》2017年第11期103-106,167,共5页Computer Simulation

基　　金：国家自然科学基金青年基金项目(61105070);天津市科委面上项目(15JCYBJC52400);湖北省高校图工委科研基金研究项目(2015-YB-06);武汉科技大学绿色制造与节能减排科技研究中心资助课题(C1013)

摘　　要：针对当前路径规划的研究,存在只考虑避免拥塞而没有考虑处理临界拥塞的问题,建立了道路交通信息抽象成的路网模型,并且在路网模型中引入道路通行能力作为边的权重,然后使用复杂网络边介数近似表征交通网络里某个临界拥塞路段转化为拥塞的概率,提出了基于复杂网络介数交通路径拥塞避免算法。实验结果表明,在道路拥挤的情况下,该算法能选择拥堵概率小的临界拥塞路段,进一步减少了拥塞的可能性。选用算法可以为出行者找到拥塞率更小的路线。For solving the problem of only considering avoiding congestion without processing critical congestion, firstly road traffic information is abstracted to traffic road network model. And the road traffic capacity is introduced as the weight of traffic road network model. Then, the edge betweenness centrality is represented as the congestion prob- ability of a critical road section in a traffic network. Finally, the congestion avoidance algorithm in transportation path planning based on betweenness centrality is proposed. The simulation results show that the proposed algorithm can choose the road with low probability of congestion, effectively avoid the congestion when the optional road sections are in the state of critical congestion, and can find less congested routes for travelers.

关 键 词：拥塞避免 介数 路网模型 复杂网络 路径规划 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]