A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem
| Autor: | Riveros, Francisco, Benítez, Néstor, Paciello, Julio, Barán, Benjamín |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
Computer engineering. Computer hardware
ant colony optimization MathematicsofComputing_NUMERICALANALYSIS traveling salesman problem Ciencias Informáticas QA75.5-76.95 NSGA2 ComputingMethodologies_ARTIFICIALINTELLIGENCE TK7885-7895 hypervolume many-objective optimization Electronic computers. Computer science nsga2 |
| Zdroj: | SEDICI (UNLP) Universidad Nacional de La Plata instacron:UNLP Journal of Computer Science and Technology, Vol 16, Iss 02, Pp 89-94 (2016) |
| Popis: | 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-known Traveling Salesman Problem (TSP). The proposed algorithm was applied to several Many-objective TSP instances, verifying the quality of the experimental results using the Hypervolume metric. A comparison with other state-of-the-art Multi Objective ACO algorithms as MAS, M3AS and MOACS as well as NSGA2 evolutionary algorithm was made, verifying that the best experimental results were obtained when the proposed algorithm was used, proving a good applicability to MaOPs. Facultad de Informática |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|