Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Sébastien Verel <>
Submitted on : Wednesday, July 18, 2012 - 3:29:36 PM
Last modification on : Wednesday, April 14, 2021 - 4:06:03 PM
Long-term archiving on: : Tuesday, December 13, 2016 - 5:21:13 PM


Files produced by the author(s)



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, Elsevier, 2011, 390 (9), pp.1684 - 1694. ⟨10.1016/j.physa.2011.01.005⟩. ⟨hal-00563461⟩



Record views


Files downloads