Improved ant colony optimization algorithm based on route optimization

Résumé fourni par la source

Two improvements on Ant Colony Optimization(ACO) algorithm is presented in this paper.The improvements are given as follows:(1)A novel optimized implementing approach is designed to reduce the processing costs involved with routing of ants in the conventional ACO.(2)In contrast to select the next city from all the cities not visited,the set of candidates is limited to the nearest c city.By this way the ant can reduce the time complexity of routing.The results of the simulated experiments show that the improved algorithm surpasses existing algorithms in performance for solving large-scale TSP problems.Simulations show that the speed of convergence of the improved ACO algorithm can be enhanced greatly compared with the traditional ACO.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.