Application of Improved Ant Colony Algorithm in Optimizing the Charging Path of Electric Vehicles

In current traffic congestion scenarios, electric vehicles (EVs) have the problem of reduced battery life and continuous decline in endurance. Therefore, this study proposes an optimization method for electric vehicle charging scheduling based onthe ant colony optimization algorithm with adaptive dynamic search (ADS-ACO), and conducts experimental verification on it. The experiment revealed that in the four benchmark functions, the research algorithm has the fastest convergence speed and can achieve convergence in most of them. In the validation of effectiveness, the optimal solution for vehicle time consumption under the ADS-ACO algorithm in the output of the algorithm with a stationary period and a remaining battery energy of 15 kW·h was 2.146 h in the regular road network. In the initial results of 15 kW·h under changes in road conditions from peak to peak periods, the total energy consumption of vehicles under the research algorithm was 4.678 kW·h and 4.656 kW·h under regular and irregular road networks, respectively. The change results were 4.509 kW·h and 4.656 kW·h, respectively. The initial results of 10 kW·h were 4.755 kW·h and 4.873 kW·h, respectively. The change results were 4.461 kW·h and 4.656 kW·h, respectively, which are lower than the comparison algorithm. In stability verification, research algorithms can find the optimal path under any conditions. The algorithm proposed in the study has been demonstrated to be highly effective and stable in electric vehicle charging path planning. It represents a novel solution for electric vehicle charging management and is expected to significantly enhance the range of electric vehicles in practical applications.