Communities of Minima in Local Optima Networks of Combinatorial Spaces - Archive ouverte HAL Access content directly
Journal Articles Physica A: Statistical Mechanics and its Applications Year : 2011

Communities of Minima in Local Optima Networks of Combinatorial Spaces

Abstract

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 shortly discuss the consequences of the findings for heuristically searching the corresponding problem spaces.
Fichier principal
Vignette du fichier
QAPcommunities.pdf (935.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00563461 , version 1 (18-07-2012)

Identifiers

Cite

Fabio Daolio, Marco Tomassini, Sébastien Verel, Gabriela Ochoa. Communities of Minima in Local Optima Networks of Combinatorial Spaces. Physica A: Statistical Mechanics and its Applications, 2011, 390 (9), pp.1684 - 1694. ⟨10.1016/j.physa.2011.01.005⟩. ⟨hal-00563461⟩
413 View
191 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More