activity
20072026
most citedA Study of NK Landscapes' Basins and Local Optima Networks

189 citations · 702 across the 38 of their papers we have counts for

collaborators
Showing 2008Show all

7 papers · 1 filter

cs.NE2008★ 20 cited

The Connectivity of NK Landscapes' Basins: A Network Analysis

Sébastien Verel, Gabriela Ochoa, Marco Tomassini

We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces. We use the well-known family of…

cs.NE2008★ 189 cited

A Study of NK Landscapes' Basins and Local Optima Networks

Gabriela Ochoa, Marco Tomassini, Sébastien Verel +1

We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces (Doye, 2002). We use the well-kno…

cs.AI2008

On the Influence of Selection Operators on Performances in Cellular Genetic Algorithms

David Simoncini, Philippe Collard, Sébastien Verel +1

In this paper, we study the influence of the selective pressure on the performance of cellular genetic algorithms. Cellular genetic algorithms are genetic algorithms where the popu…

cs.NE2008

From Cells to Islands: An unified Model of Cellular Parallel Genetic Algorithms

David Simoncini, Philippe Collard, Sébastien Verel +1

This paper presents the Anisotropic selection scheme for cellular Genetic Algorithms (cGA). This new scheme allows to enhance diversity and to control the selective pressure which…

cs.NE2008

Evolving Dynamic Change and Exchange of Genotype Encoding in Genetic Algorithms for Difficult Optimization Problems

Maroun Bercachi, Philippe Collard, Manuel Clergue +1

The application of genetic algorithms (GAs) to many optimization problems in organizations often results in good performance and high quality solutions. For successful and efficien…

cs.NE2008

Neutral Fitness Landscape in the Cellular Automata Majority Problem

Sébastien Verel, Philippe Collard, Marco Tomassini +1

We study in detail the fitness landscape of a difficult cellular automata computational task: the majority problem. Our results show why this problem landscape is so hard to search…