The Convergence Control to the ACO Metaheuristic Using Annotated Paraconsistent Logic

Authors:
Luiz Eduardo Silva;Helga Gonzaga Martins;Maurilio Pereira Coutinho;Germano Lambert-Torres;Luiz Eduardo Silva
Affiliations:
Alfenas Federal University,;Itajuba Federal University, Itajubá, Brasil CEP 37500-903;Alfenas Federal University,;Itajuba Federal University, Itajubá, Brasil CEP 37500-903;Itajuba Federal University, Itajubá, Brasil CEP 37500-903
Venue:
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
Year:
2009

Citing 4
Cited 0

MAX-MIN Ant system

Future Generation Computer Systems
Ant colony optimization

IEEE Computational Intelligence Magazine
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to solve complex combinatorial optimizations problems is the Ant Colony Optimization Metaheuristic (ACO). There are several variations of this metaheuristic. One of them, the Max-Min Ant System, is an algorithm that presents excellent performance for some classes of combinatorial problems, such as Traveling Salesman Problem and the Quadratic Assignment Problem. This paper presents a method of convergence control of the Max-Min variation of Ant Colony Optimization Metaheuristic using paraconsistent logic. The proposed method can be adapted to any variation of the Ant Colony Optimization Metaheuristic.