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 2012 · cs.NEShow all

11 papers · 2 filters

cs.NE2012★ 5 cited

Clustering of Local Optima in Combinatorial Fitness Landscapes

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

Using the recently proposed model of combinatorial landscapes: local optima networks, we study the distribution of local optima in two classes of instances of the quadratic assignm…

cs.NE2012★ 19 cited

Analyzing the Effect of Objective Correlation on the Efficient Set of MNK-Landscapes

Sébastien Verel, Arnaud Liefooghe, Laetitia Jourdan +1

In multiobjective combinatorial optimization, there exists two main classes of metaheuristics, based either on multiple aggregations, or on a dominance relation. As in the single o…

cs.NE2012★ 23 cited

On the Neutrality of Flowshop Scheduling Fitness Landscapes

Marie-Eleonore Marmion, Clarisse Dhaenens, Laetitia Jourdan +2

Solving efficiently complex problems using metaheuristics, and in particular local searches, requires incorporating knowledge about the problem to solve. In this paper, the permuta…

cs.NE2012

On the Effect of Connectedness for Biobjective Multiple and Long Path Problems

Sébastien Verel, Arnaud Liefooghe, Jérémie Humeau +2

Recently, the property of connectedness has been claimed to give a strong motivation on the design of local search techniques for multiobjective combinatorial optimization (MOCO).…

cs.NE2012★ 2 cited

The Road to VEGAS: Guiding the Search over Neutral Networks

Marie-Eleonore Marmion, Clarisse Dhaenens, Laetitia Jourdan +2

VEGAS (Varying Evolvability-Guided Adaptive Search) is a new methodology proposed to deal with the neutrality property of some optimization problems. ts main feature is to consider…

cs.NE2012★ 1 cited

First-improvement vs. Best-improvement Local Optima Networks of NK Landscapes

Gabriela Ochoa, Sébastien Verel, Marco Tomassini

This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedy-ascent) hill-climbing algorithm,…

cs.NE2012

Pareto Local Optima of Multiobjective NK-Landscapes with Correlated Objectives

Sébastien Verel, Arnaud Liefooghe, Laetitia Jourdan +1

In this paper, we conduct a fitness landscape analysis for multiobjective combinatorial optimization, based on the local optima of multiobjective NK-landscapes with objective corre…

cs.NE2012★ 20 cited

Set-based Multiobjective Fitness Landscapes: A Preliminary Study

Sébastien Verel, Arnaud Liefooghe, Clarisse Dhaenens

Fitness landscape analysis aims to understand the geometry of a given optimization problem in order to design more efficient search algorithms. However, there is a very little know…

cs.NE2012

NILS: a Neutrality-based Iterated Local Search and its application to Flowshop Scheduling

Marie-Eleonore Marmion, Clarisse Dhaenens, Laetitia Jourdan +2

This paper presents a new methodology that exploits specific characteristics from the fitness landscape. In particular, we are interested in the property of neutrality, that deals…

cs.NE2012★ 10 cited

DAMS: Distributed Adaptive Metaheuristic Selection

Bilel Derbel, Sébastien Verel

We present a distributed generic algorithm called DAMS dedicated to adaptive optimization in distributed environments. Given a set of metaheuristic, the goal of DAMS is to coordina…

cs.NE2012★ 2 cited

Communities of Minima in Local Optima Networks of Combinatorial Spaces

Fabio Daolio, Marco Tomassini, Sébastien Verel +1

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 t…