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. © Springer-Verlag 2009.
Author supplied keywords
Cite
CITATION STYLE
Da Silva, L. E., Martins, H. G., Coutinho, M. P., Lambert-Torres, G., & Borges Da Silva, L. E. (2009). The convergence control to the ACO metaheuristic using annotated paraconsistent logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5821 LNCS, pp. 382–391). https://doi.org/10.1007/978-3-642-04843-2_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
