<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-07T07:14:48Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/27974" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/27974</identifier><datestamp>2026-02-03T11:47:08Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37959</setSpec></header><metadata><qdc:qualifieddc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>A Study About Meta-Optimizing the NSGA-II Multi-Objective Evolutionary Algorithm.</dc:title>
   <dc:creator>Aldana Martín, José Francisco</dc:creator>
   <dc:creator>Nebro-Urbaneja, Antonio Jesús</dc:creator>
   <dc:creator>Durillo, Juan J.</dc:creator>
   <dc:creator>Roldán-García, María del Mar</dc:creator>
   <dc:subject>Programación heurística</dc:subject>
   <dc:subject>Optimización matemática</dc:subject>
   <dc:subject>Algoritmos computacionales</dc:subject>
   <dcterms:abstract>The automatic design of multi-objective metaheuristics is an active research line aimed at, given a set of problems used as training set, to find the configuration of a multi-objective optimizer able of solving them efficiently. The expected outcome is that the auto-configured algorithm can be used of find accurate Pareto front approximations for other problems. In this paper, we conduct a study on the meta-optimization of the wellknown NSGA-II algorithm, i.e., we intend to use NSGA-II as an automatic configuration tool to find configurations of NSGA-II. This search can be formulated as a multi-objective problem where the decision variables are the NSGA-II components and parameters and the the objectives are quality indicators that have to be minimized. To develop this study, we rely on the jMetal framework. The analysis we propose is aimed at answering the following research questions: RQ1 - how complex is to build the meta-optimization package?, and RQ2 - can accurate configurations be found? We conduct an experimentation to give an answer to these questions.</dcterms:abstract>
   <dcterms:dateAccepted>2023-11-08T13:53:48Z</dcterms:dateAccepted>
   <dcterms:available>2023-11-08T13:53:48Z</dcterms:available>
   <dcterms:created>2023-11-08T13:53:48Z</dcterms:created>
   <dcterms:issued>2023</dcterms:issued>
   <dc:type>conference output</dc:type>
   <dc:identifier>https://hdl.handle.net/10630/27974</dc:identifier>
   <dc:language>spa</dc:language>
   <dc:relation>9th International Conference on Metaheuristics and Nature Inspired Computing</dc:relation>
   <dc:relation>Marrakech, Marruecos</dc:relation>
   <dc:relation>Noviembre 2023</dc:relation>
   <dc:rights>open access</dc:rights>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>