Study On The Path Optimization Of Over-saturation Intersections Based On Ant Colony Algorithm

With the rise of China's economy,urbanization,inventories of cars,traffic congestion has been a common thing.Traffic congestion is generally caused by one or two intersections,which gradually affect the intersection group consisted of several adjacent intersections,the congestion is more serious especially in the case of over saturating intersections,at this time,the path distance factor is not the prior problem that the majority of people think about when travel.How to find a shortest path in the intersection group consisted of over saturating intersections is often a prior matter for us.This paper studies the over saturating intersection group and introduces the group intelligent algorithm-ant colony algorithm,with the advantage of the algorithm in path optimization,we will find the optimal path and improve the method from the distance standard to the time standard,find the fastest path from the starting point to the destination among over saturating intersection groups.Combine the data of transit time of the intersection and the road,with using the ant colony algorithm to realize the finding process of shortest optimal path by MATLAB programming.The optimal path of the over saturating intersection groups is obtained by combining the study with the calculating example,improve the feasibility and correctness of the algorithm and the program which are verified by the comparison between the calculated result and the running result of the program.The main work of this paper is as follows: the introduction of background and significance of the optimization study of over saturating intersection groups based on ant colony algorithm,the review of main research results in related fields at home and abroad.The elaboration of model and basic theory of ant colony algorithm,the study of improvement ideas of ant colony algorithm,the definition of over saturating intersection groups,the study of time calculation standard and the intersection delay model used in the improvement of the ant colony algorithm.Based on the above research,take the example of the basic road network consisted of six over saturating intersections,design the optimization path program of over saturating intersection group based on ant colony improvement algorithm with using MATLAB,analyze the rationality of main program parameters,explain the data source,the data processing method and the presentation method of the delay time.Through the program design,the process of using the ant colony improvement algorithm to achieve the path optimization in the over saturating intersection group is realized,the rationality and correctness of the improved algorithm and program are verified by calculating two sets of data.The results of the study show that the improved ant colony algorithm can find the shortest path in the over saturating intersection groups,and the improved algorithm has better expansibility.