Vehicle group path planning algorithm considering equilibrium

The congestion problem of a large number of vehicles traveling during morning and evening rush hours is an urgent problem to be solved. Vehicle routing is a way to solve the traffic congestion problem. In order to solve this problem, based on the analysis of the characteristics of vehicle travel in the morning and evening peak hours, the path planning strategy for a group of vehicles is studied. This paper establishes a balanced use model for road networks, and the overall income and arrival time are used as the constraint condition. Based on the model, the ant colony algorithm is used to plan the group vehicle path, and the group path planning optimizes the road utilization. The simulation results show that the proposed algorithm can reasonably use the road network resources, and the time for all vehicles to arrive at the destination is less than that of the shortest path algorithm.