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

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

collaborators
Showing 2012Show all

11 papers · 1 filter

physics.soc-ph2012★ 20 cited

Evolution of Cooperation on Spatially Embedded Networks

Pierre Buesser, Marco Tomassini

In this work we study the behavior of classical two-person, two-strategies evolutionary games on networks embedded in a Euclidean two-dimensional space with different kinds of degr…

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.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★ 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★ 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…