Publicación:
Self-Adaptive Polynomial Mutation in NSGA-II

Vista sencilla de ítem
dc.contributor.authorCarles Bou, José Luis
dc.contributor.authorFernández Galán, Severino
dc.date.accessioned2024-09-12T07:20:41Z
dc.date.available2024-09-12T07:20:41Z
dc.date.issued2023-08-21
dc.description.abstractEvolutionary multi-objective optimization is a field that has experienced a rapid growth in the last two decades. Although an important number of new multi-objective evolutionary algorithms have been designed and implemented by the scientific community, the popular Non-Dominated Sorting Genetic Algorithm (NSGA-II) remains as a widely used baseline for algorithm performance comparison purposes and applied to different engineering problems. Since every evolutionary algorithm needs several parameters to be set up in order to operate, parameter control constitutes a crucial task for obtaining an effective and efficient performance in its execution. However, despite the advancements in parameter control for evolutionary algorithms, NSGA-II has been mainly used in the literature with fine-tuned static parameters. This paper introduces a novel and computationally lightweight self-adaptation mechanism for controlling the distribution index parameter of the polynomial mutation operator usually employed by NSGA-II in particular and by multi-objective evolutionary algorithms in general. Additionally, the classical NSGA-II using polynomial mutation with a static distribution index is compared with this new version utilizing a self-adapted parameter. The experiments carried out over twenty-five benchmark problems show that the proposed modified NSGA-II with a self-adaptive mutator outperforms its static counterpart in more than 75% of the problems using three quality metrics (hypervolume, generalized spread, and modified inverted generational distance).en
dc.description.versionversión final
dc.identifier.citationCarles Bou, José Luis; Fernández Galán, Severino (2023) Self-Adaptive Polynomial Mutation in NSGA-II . Soft Computing 27, pp.17711–17727 . https://doi.org/10.1007/s00500-023-09049-0
dc.identifier.doihttps://doi.org/10.1007/s00500-023-09049-0
dc.identifier.issn1433-7479 ; eISSN: 1432-7643
dc.identifier.urihttps://hdl.handle.net/20.500.14468/23712
dc.journal.issue23
dc.journal.titleSoft Computing
dc.journal.volume27
dc.language.isoen
dc.page.final17727
dc.page.initial17711
dc.publisherSpringer
dc.relation.centerE.T.S. de Ingeniería Informática
dc.relation.departmentInteligencia Artificial
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/deed.es
dc.subject12 Matemáticas::1203 Ciencia de los ordenadores ::1203.04 Inteligencia artificial
dc.subject12 Matemáticas::1203 Ciencia de los ordenadores ::1203.17 Informática
dc.subject.keywordsmulti-objective evolutionary algorithmen
dc.subject.keywordsNSGA-IIen
dc.subject.keywordspolynomial mutationen
dc.subject.keywordsdistribution index self-adaptationen
dc.titleSelf-Adaptive Polynomial Mutation in NSGA-IIes
dc.typeartículoes
dc.typejournal articleen
dspace.entity.typePublication
relation.isAuthorOfPublicationa91aef9f-537b-41ae-a323-5a166ee934f6
relation.isAuthorOfPublication.latestForDiscoverya91aef9f-537b-41ae-a323-5a166ee934f6
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
FernandezGalan_Severino_PolynomialMutation.pdf
Tamaño:
857.4 KB
Formato:
Adobe Portable Document Format
Descargar
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
3.62 KB
Formato:
Item-specific license agreed to upon submission
Descripción:
Descargar
Colecciones
Artículos y papers