Ant Algorithms Unification and Improvement

Abstract: Ant Colony Optimization (ACO) a nature-inspired metaheuristic algorithm has been successfully applied in the traveling salesman problem (TSP) and a variety of combinatorial problems. ACO algorithms have been modified in recent years to improve the performance of the first algorithm, posed by Dorigo. In this paper we compare different ACO algorithms and combine them in order to collect their advantages in an extended ACO algorithm