<?xml version="1.0" encoding="UTF-8"?>
<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">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems</dc:title>
   	<dc:creator>Rook, J</dc:creator>
   	<dc:creator>Trautmann, Heike</dc:creator>
   	<dc:creator>Bossek, Jakob</dc:creator>
   	<dc:creator>Grimme, C</dc:creator>
   	<dc:creator>Fieldsend, J</dc:creator>
   	<dc:creator>Wagner, M.</dc:creator>
   	<dc:description>Hardness of Multi-Objective (MO) continuous optimization problems results from an interplay of various problem characteristics, e. g. the degree of multi-modality. We present a benchmark study of classical and diversity focused optimizers on multi-modal MO problems based on automated algorithm configuration. We show the large effect of the latter and investigate the trade-off between convergence in objective space and diversity in decision space.</dc:description>
   	<dc:publisher>Association for Computing Machinery</dc:publisher>
   	<dc:date>2022</dc:date>
   	<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
   	<dc:type>doc-type:conferenceObject</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
   	<dc:identifier>https://ris.uni-paderborn.de/record/46305</dc:identifier>
   	<dc:source>Rook J, Trautmann H, Bossek J, Grimme C. On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems. In: Fieldsend J, Wagner M, eds. &lt;i&gt;Proceedings of the Genetic and Evolutionary Computation Conference Companion&lt;/i&gt;. GECCO ’22. Association for Computing Machinery; 2022:356–359. doi:&lt;a href=&quot;https://doi.org/10.1145/3520304.3528998&quot;&gt;10.1145/3520304.3528998&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1145/3520304.3528998</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/isbn/9781450392686</dc:relation>
   	<dc:rights>info:eu-repo/semantics/closedAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
