A Many-objective Ant Colony Optimizationapplied to the Traveling Salesman Problem

Evolutionary algorithms present performancedrawbacks when applied to Many-objective Op-timization Problems (MaOPs). In this work, anovel approach based on Ant Colony Optimiza-tion theory (ACO), denominated ACOλbase-palgorithm, is proposed in order to handle Many-objective instances of the well...

Full beskrivning

Sparad:
Bibliografiska uppgifter
I publikationen:Journal of Computer Science and Technology
Huvudupphovsmän: Francisco Riveros, Néstor Benítez, Julio Paciello, Benjamín Barán
Materialtyp: Artigo
Språk:Inglês
Publicerad: Universidad Nacional de La Plata 2016
Ämnen:
Computación
Many
NSGA2
Hypervolume
objective optimization
Ant Colony Optimization
Länkar:https://www.redalyc.org/articulo.oa?id=638067262007
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk