Local optima networks and the performance of iterated local searchReport as inadecuate




Local optima networks and the performance of iterated local search - Download this document for free, or read online. Document in PDF available to download.

1 ISI - Institut des systèmes d-information 2 Laboratoire d-Informatique, Signaux, et Systèmes de Sophia-Antipolis I3S - Groupe SCOBI MDSC - Modèles Discrets pour les Systèmes Complexes 3 DOLPHIN - Parallel Cooperative Multi-criteria Optimization LIFL - Laboratoire d-Informatique Fondamentale de Lille, Inria Lille - Nord Europe 4 School of Computer Science

Abstract : Local Optima Networks LONs have been recently proposed as an alternative model of combinatorial fitness landscapes. The model compresses the information given by the whole search space into a smaller mathematical object that is the graph having as vertices the local optima and as edges the possible weighted transitions between them. A new set of metrics can be derived from this model that capture the distribution and connectivity of the local optima in the underlying configuration space. This paper departs from the descriptive analysis of local optima networks, and actively studies the correlation between network features and the performance of a local search heuristic. The NK family of landscapes and the Iterated Local Search metaheuristic are considered. With a statistically-sound approach based on multiple linear regression, it is shown that some LONs- features strongly influence and can even partly predict the performance of a heuristic search algorithm. This study validates the expressive power of LONs as a model of combinatorial fitness landscapes.

Keywords : combinatorial fitness landscape local optima network local search heuristics





Author: Fabio Daolio - Sébastien Verel - Gabriela Ochoa - Marco Tomassini -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents