A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem

Evolutionary algorithms present performance drawbacks when applied to Many-objective Optimization Problems (MaOPs). In this work, a novel approach based on Ant Colony Optimization theory (ACO), denominated ACO λ base-p algorithm, is proposed in order to handle Manyobjective instances of the well-kno...

Full description

Bibliographic Details
Main Authors: Francisco Riveros, Néstor Benítez, Julio Paciello, Benjamín Barán
Format: Article
Language:English
Published: Postgraduate Office, School of Computer Science, Universidad Nacional de La Plata 2016-11-01
Series:Journal of Computer Science and Technology
Subjects:
Online Access:https://journal.info.unlp.edu.ar/JCST/article/view/496