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 cs.AIShow all

15 papers · 1 filter

cs.AI2024

Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances

Sébastien Verel, Sarah Thomson, Omar Rifki

The Quadratic Assignment Problem (QAP) is one of the major domains in the field of evolutionary computation, and more widely in combinatorial optimization. This paper studies the p…

cs.AI2014

On the Impact of Multiobjective Scalarizing Functions

Bilel Derbel, Dimo Brockhoff, Arnaud Liefooghe +1

Recently, there has been a renewed interest in decomposition-based approaches for evolutionary multiobjective optimization. However, the impact of the choice of the underlying scal…

cs.AI2014★ 5 cited

Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives

Manuel López-Ibáñez, Arnaud Liefooghe, Sébastien Verel

The properties of local optimal solutions in multi-objective combinatorial optimization problems are crucial for the effectiveness of local search algorithms, particularly when the…

cs.AI2012★ 25 cited

Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance

Francisco Chicano, Fabio Daolio, Gabriela Ochoa +3

Recent developments in fitness landscape analysis include the study of Local Optima Networks (LON) and applications of the Elementary Landscapes theory. This paper represents a fir…

cs.AI2012★ 30 cited

Local optima networks and the performance of iterated local search

Fabio Daolio, Sébastien Verel, Gabriela Ochoa +1

Local Optima Networks (LONs) have been recently proposed as an alternative model of combinatorial fitness landscapes. The model compresses the information given by the whole search…

cs.AI2011

NK landscapes difficulty and Negative Slope Coefficient: How Sampling Influences the Results

Leonardo Vanneschi, Sébastien Verel, Philippe Collard +1

Negative Slope Coefficient is an indicator of problem hardness that has been introduced in 2004 and that has returned promising results on a large set of problems. It is based on t…

cs.AI2011★ 7 cited

Centric selection: a way to tune the exploration/exploitation trade-off

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

In this paper, we study the exploration / exploitation trade-off in cellular genetic algorithms. We define a new selection scheme, the centric selection, which is tunable and allow…

cs.AI2011★ 1 cited

Local Optima Networks of NK Landscapes with Neutrality

Sébastien Verel, Gabriela Ochoa, Marco Tomassini

In previous work we have introduced a network-based model that abstracts many details of the underlying landscape and compresses the landscape information into a weighted, oriented…

cs.AI2011

Local Optima Networks of the Quadratic Assignment Problem

Fabio Daolio, Sébastien Verel, Gabriela Ochoa +1

Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob…

cs.AI2009★ 17 cited

Deceptiveness and Neutrality - the ND family of fitness landscapes

William Beaudoin, Sébastien Verel, Philippe Collard +1

When a considerable number of mutations have no effects on fitness values, the fitness landscape is said neutral. In order to study the interplay between neutrality, which exists i…

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.AI2008★ 22 cited

Anisotropic selection in cellular genetic algorithms

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

In this paper we introduce a new selection scheme in cellular genetic algorithms (cGAs). Anisotropic Selection (AS) promotes diversity and allows accurate control of the selective…

cs.AI2007

Measuring the Evolvability Landscape to study Neutrality

Sébastien Verel, Philippe Collard, Manuel Clergue

This theoretical work defines the measure of autocorrelation of evolvability in the context of neutral fitness landscape. This measure has been studied on the classical MAX-SAT pro…

cs.AI2007★ 21 cited

Local search heuristics: Fitness Cloud versus Fitness Landscape

Philippe Collard, Sébastien Verel, Manuel Clergue

This paper introduces the concept of fitness cloud as an alternative way to visualize and analyze search spaces than given by the geographic notion of fitness landscape. It is argu…

cs.AI2007★ 30 cited

Fitness landscape of the cellular automata majority problem: View from the Olympus

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

In this paper we study cellular automata (CAs) that perform the computational Majority task. This task is a good example of what the phenomenon of emergence in complex systems is.…