软件导刊2025，Vol.24Issue(3)：16-22,7.DOI:10.11907/rjdk.241173
面向电动汽车路径规划的随机竞争蚁群算法
Random Competition Based Ant Colony Optimization for Electric Vehicle Routing Problem
摘要
Abstract
Due to environmental considerations,electric vehicles are becoming increasingly popular in contemporary society,and their path planning problems have also been widely studied.Vehicle path planning is a well-known NP hard problem,and tram path planning also needs to consider the charging problem.To this end,an improved ant colony algorithm is proposed,and a random competition based ant colony pher-omone update strategy is designed.Some ants are randomly selected from the ant colony,paired together,and a better updated pheromone ma-trix is selected from each pair of ants,thus maintaining a good balance between search diversity and convergence;At the same time,local search strategies are added in the later stages of iteration to improve the accuracy of solving the optimal solution.The experimental results show that compared with traditional ant colony algorithm,the improved ant colony algorithm has more advantages in solution accuracy and conver-gence speed.关键词
蚁群算法/随机竞争/路径规划/组合优化/信息素更新Key words
ant colony optimization/random competition/routing planning/combinatorial optimization/pheromone update分类
计算机与自动化引用本文复制引用
曹浩,杨强..面向电动汽车路径规划的随机竞争蚁群算法[J].软件导刊,2025,24(3):16-22,7.基金项目
国家自然科学基金项目(62006124,62272108,U20B2061) （62006124,62272108,U20B2061）
