Dynamic Path Planning Based on Improved Ant Colony Algorithm in Traffic Congestion

Abstract

Congestion road condition is an important factor that must be considered in urban traffic path planning, while most path planning algorithms only consider the distance factor, which is not suitable for the current complex urban traffic congestion road condition. In order to solve the above problems, this article proposes a dynamic path planning method based on improved ant colony algorithm in congested traffic. The method quantifies the main attributes of urban road length, number of lanes, incoming and outgoing traffic flow, and introduces the road factor used for replacing the distance parameters of particle swarm optimization and ant colony algorithm. In the method, the particle swarm algorithm can effectively optimize the parameters of the ant colony algorithm, and significantly improve the efficiency of ant colony algorithm, such that it is more applicable for dynamic path planning application to greatly reduce the congestion rate of path planning. In addition, this article selects some intersections in the Beijing area to carry out the dynamic path planning experiment based on the improved ant colony algorithm under congested road conditions. The experimental results show that, compared with the ant colony algorithm based on distance parameter, the proposed dynamic path planning method can effectively reduce the average congestion rate ranging from 9.73% to 13.63%.

Keywords

• Traffic congestion
• road condition factor
• ant colony algorithm
• particle swarm optimization
• path planning