• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Communities of Minima in Local Optima ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Article dans une revue scientifique
DOI :
10.1016/j.physa.2011.01.005
Title :
Communities of Minima in Local Optima Networks of Combinatorial Spaces
Author(s) :
Daolio, Fabio [Auteur]
Tomassini, Marco [Auteur]
Verel, Sébastien [Auteur]
Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Groupe SCOBI
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Ochoa, Gabriela [Auteur]
University of Nottingham, UK [UON]
Journal title :
Physica A: Statistical Mechanics and its Applications
Pages :
1684 - 1694
Publisher :
Elsevier
Publication date :
2011-05
ISSN :
0378-4371
English keyword(s) :
Community structure
Optima networks
Combinatorial fitness landscapes
HAL domain(s) :
Informatique [cs]/Intelligence artificielle [cs.AI]
English abstract : [en]
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 ...
Show more >
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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-00563461/document
  • Open access
  • Access the document
Thumbnail
  • http://arxiv.org/pdf/1207.4445
  • Open access
  • Access the document
Thumbnail
  • https://hal.archives-ouvertes.fr/hal-00563461/document
  • Open access
  • Access the document
Université de Lille

Mentions légales
Université de Lille © 2017