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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Riveros, Francisco, Benítez, Néstor, Paciello, Julio, Barán, Benjamín
Formato: Articulo
Lenguaje:Inglés
Publicado: 2016
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/57269
http://journal.info.unlp.edu.ar/wp-content/uploads/2016/12/JCST-43-Paper-4.pdf
Aporte de:
id I19-R120-10915-57269
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
ant colony optimization
traveling salesman problem
many-objective optimization
hypervolume
NSGA2
spellingShingle Ciencias Informáticas
ant colony optimization
traveling salesman problem
many-objective optimization
hypervolume
NSGA2
Riveros, Francisco
Benítez, Néstor
Paciello, Julio
Barán, Benjamín
A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem
topic_facet Ciencias Informáticas
ant colony optimization
traveling salesman problem
many-objective optimization
hypervolume
NSGA2
description 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.
format Articulo
Articulo
author Riveros, Francisco
Benítez, Néstor
Paciello, Julio
Barán, Benjamín
author_facet Riveros, Francisco
Benítez, Néstor
Paciello, Julio
Barán, Benjamín
author_sort Riveros, Francisco
title A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem
title_short A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem
title_full A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem
title_fullStr A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem
title_full_unstemmed A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem
title_sort many-objective ant colony optimization applied to the traveling salesman problem
publishDate 2016
url http://sedici.unlp.edu.ar/handle/10915/57269
http://journal.info.unlp.edu.ar/wp-content/uploads/2016/12/JCST-43-Paper-4.pdf
work_keys_str_mv AT riverosfrancisco amanyobjectiveantcolonyoptimizationappliedtothetravelingsalesmanproblem
AT beniteznestor amanyobjectiveantcolonyoptimizationappliedtothetravelingsalesmanproblem
AT paciellojulio amanyobjectiveantcolonyoptimizationappliedtothetravelingsalesmanproblem
AT baranbenjamin amanyobjectiveantcolonyoptimizationappliedtothetravelingsalesmanproblem
AT riverosfrancisco manyobjectiveantcolonyoptimizationappliedtothetravelingsalesmanproblem
AT beniteznestor manyobjectiveantcolonyoptimizationappliedtothetravelingsalesmanproblem
AT paciellojulio manyobjectiveantcolonyoptimizationappliedtothetravelingsalesmanproblem
AT baranbenjamin manyobjectiveantcolonyoptimizationappliedtothetravelingsalesmanproblem
bdutipo_str Repositorios
_version_ 1764820478074028034