蚁群优化算法
计算机科学
遗传算法
算法
蚁群
人工蜂群算法
旅行商问题
数学优化
元优化
选择(遗传算法)
出处
期刊:2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)
日期:2020-06-01
被引量:10
标识
DOI:10.1109/itnec48623.2020.9084730
摘要
This article focuses on an improved ant colony algorithm for solving the problem of route planning. An ant colony algorithm (ACO) fusion with genetic algorithm (GA) is proposed and verified by simulations. The genetic algorithm is used to calculate the initial pheromone according to the route nodes distribution. The output of GA is considered as prior information fed to ACO algorithm by selecting, crossing and variation evolution operations. Comparing with the ACO and GA routing algorithms individually under the condition of 10,20,40 nodes distribution within the region of interest based on MATLAB simulation, the fusion ACO-GA algorithm achieves the shortest route and fitness evolution results. Experimental tests have indicated that with the interior nodes of the interesting region increasing, the route distance obtained by the improved algorithm is shorter than GA and ACO algorithms both. Moreover, the proposed ant colony algorithm fusion with GA has fewer iterations to obtain the optimal solution, and the calculation time cost is decreased obviously.
科研通智能强力驱动
Strongly Powered by AbleSci AI