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

摘要

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 probability 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.%针对当前路径规划的研究,存在只考虑避免拥塞而没有考虑处理临界拥塞的问题,建立了道路交通信息抽象成的路网模型,并且在路网模型中引人道路通行能力作为边的权重,然后使用复杂网络边介数近似表征交通网络里某个临界拥塞路段转化为拥塞的概率,提出了基于复杂网络介数交通路径拥塞避免算法.实验结果表明,在道路拥挤的情况下,该算法能选择拥堵概率小的临界拥塞路段,进一步减少了拥塞的可能性.选用算法可以为出行者找到拥塞率更小的路线.