Mostrar el registro sencillo del ítem

AutorRivera Zarate, Gilberto
Accedido2022-12-13T15:40:41Z
Disponible2022-12-13T15:40:41Z
Fecha de publicación2022-11-19es_MX
Identificador de objeto (URI)http://cathi.uacj.mx/20.500.11961/22919
Resumen/AbstractMany-objective optimization is an area of interest common to researchers, professionals, and practitioners because of its real-world implications. Preference incorporation into Multi-Objective Evolutionary Algorithms (MOEAs) is one of the current approaches to treat Many-Objective Optimization Problems (MaOPs). Some recent studies have focused on the advantages of embedding preference models based on interval outranking into MOEAs; several models have been proposed to achieve it. Since there are many factors influencing the choice of the best outranking model, there is no clear notion of which is the best model to incorporate the preferences of the decision maker into a particular problem. This paper proposes a hyper-heuristic algorithm—named HyperACO—that searches for the best combination of several interval outranking models embedded into MOEAs to solve MaOPs. HyperACO is able not only to select the most appropriate model but also to combine the already existing models to solve a specific MaOP correctly. The results obtained on the DTLZ and WFG test suites corroborate that HyperACO can hybridize MOEAs with a combined preference model that is suitable to the problem being solved. Performance comparisons with other state-of-the-art MOEAs and tests for statistical significance validate this conclusion.es_MX
Idioma ISOen_USes_MX
Referencias físicas o lógicasProducto de investigación IITes_MX
Referencias físicas o lógicasInstituto de Ingeniería y Tecnologíaes_MX
TemaAnt Colony Optimizationes_MX
TemaMany-objective evolutionary algorithmses_MX
TemaPreference incorporationes_MX
TemaOutranking approaches_MX
TemaInterval numberses_MX
Área de conocimiento CONACYTinfo:eu-repo/classification/cti/7es_MX
TítuloAn ACO-based Hyper-heuristic for Sequencing Many-objective Evolutionary Algorithms that Consider Different Ways to Incorporate the DM's Preferenceses_MX
Tipo de productoArtículoes_MX
Imagen repositoriohttp://ri.uacj.mx/vufind/thumbnails/rupiiit.pnges_MX
Instituto (dcrupi)Instituto de Ingeniería y Tecnologíaes_MX
CosechableSies_MX
Volumen76es_MX
Identificador DOIhttps://doi.org/10.1016/j.swevo.2022.101211es_MX
Título de revistaSwarm and Evolutionary Computationes_MX
dc.contributor.coauthorexternoCruz-Reyes, Laura
dc.contributor.coauthorexternoFernández, Eduardo
dc.contributor.coauthorexternoGómez-Santillán, Claudia
dc.contributor.coauthorexternoRangel-Valdez, Nelson
dc.contributor.coauthorexternoCoello Coello, Carlos Artemio
dcrupi.pronacesNingunoes_MX


Archivos en el ítem

No Thumbnail [100%x80]

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem


Av. Plutarco Elías Calles #1210 • Fovissste Chamizal
Ciudad Juárez, Chihuahua, México • C.P. 32310 • Tel. (+52) 688 – 2100 al 09