
1414
Variants of Ant Colony Variants of Ant Colony
Optimization: A Metaheuristic Optimization: A Metaheuristic
for Solving the Traveling for Solving the Traveling
Salesman Problem Salesman Problem
Iván Chaparro, Fevrier Valdez and Patricia Melin*
ABSTRACT
Ant Colony Optimization (ACO) has been used to solve several
optimization problems. However, in this paper, the variants of ACO
have been applied to solve the Traveling Salesman Problem (TSP), which
is used to evaluate the ACO variants as Benchmark problems. Also, we
developed a graphic interface to allow the user to input parameters
and having as objective to reduce processing time through a ...