<?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-05-31T05:30:18Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/8194" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/8194</identifier><datestamp>2026-02-03T11:47:04Z</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>Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance</dc:title>
   <dc:creator>Chicano-García, José-Francisco</dc:creator>
   <dc:creator>Daolio, Fabio</dc:creator>
   <dc:creator>Ochoa, Gabriela</dc:creator>
   <dc:creator>Verel, Sébastien</dc:creator>
   <dc:creator>Tomassini, Marco</dc:creator>
   <dc:creator>Alba-Torres, Enrique</dc:creator>
   <dc:subject>Algoritmos computacionales</dc:subject>
   <dcterms:abstract>Recent developments in fitness landscape analysis include the study of Local Optima Networks (LON) and applications of the Elementary Landscapes theory. This paper represents a first step at combining these two tools to explore their ability to forecast the performance of search algorithms. We base our analysis on the Quadratic Assignment Problem (QAP) and conduct a large statistical study over 600 generated instances of different types. Our results reveal interesting links between the network measures, the autocorrelation measures and the performance of heuristic search algorithms.</dcterms:abstract>
   <dcterms:dateAccepted>2014-10-06T11:01:28Z</dcterms:dateAccepted>
   <dcterms:available>2014-10-06T11:01:28Z</dcterms:available>
   <dcterms:created>2014-10-06T11:01:28Z</dcterms:created>
   <dcterms:issued>2014-10-06</dcterms:issued>
   <dc:type>conference output</dc:type>
   <dc:identifier>http://hdl.handle.net/10630/8194</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>Parallel Problem Solving from Nature</dc:relation>
   <dc:relation>Taormina, Italy</dc:relation>
   <dc:relation>1/9/2012</dc:relation>
   <dc:rights>open access</dc:rights>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>