Communities of Minima in Local Optima Networks of Combinatorial Spaces

Détails

ID Serval
serval:BIB_9EEDAB82F7B9
Type
Article: article d'un périodique ou d'un magazine.
Collection
Publications
Institution
Titre
Communities of Minima in Local Optima Networks of Combinatorial Spaces
Périodique
Physica A: Statistical Mechanics and its Applications
Auteur(s)
Fabio Daolio, Marco Tomassini, Sébastien Vérel, Gabriela Ochoa
ISSN
0378-4371
Statut éditorial
Publié
Date de publication
2011
Peer-reviewed
Oui
Volume
390
Numéro
9
Pages
1684-1694
Langue
anglais
Résumé
In this work, we present a new methodology to study the structure of the configuration spaces of hard combinatorial problems. It consists in building the network that has as nodes the locally optimal configurations and as edges the weighted oriented transitions between their basins of attraction. We apply the approach to the detection of communities in the optima networks produced by two different classes of instances of a hard combinatorial optimization problem: the quadratic assignment problem (QAP). We provide evidence indicating that the two problem instance classes give rise to very different configuration spaces. For the so-called real-like class, the networks possess a clear modular structure, while the optima networks belonging to the class of random uniform instances are less well partitionable into clusters. This is convincingly supported by using several statistical tests. Finally, we briefly discuss the consequences of the findings for heuristically searching the corresponding problem spaces.
Mots-clé
Combinatorial fitness landscapes
Création de la notice
27/02/2011 15:33
Dernière modification de la notice
01/11/2019 10:30
Données d'usage