This paper proposes an alternative definition of edges (escape edges) for the recently introduced network-based model of combinatorial landscapes: Local Optima Networks (LON). The model compresses the information given by the whole search space into a smaller mathematical object that is the graph having as vertices the local optima and as edges...
-
October 24, 2011 (v1)Conference paperUploaded on: December 3, 2022
-
May 2011 (v1)Journal article
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...
Uploaded on: December 4, 2022 -
January 17, 2011 (v1)Conference paper
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 assignment problem. Our results indicate that the two problem instance classes give rise to very different configuration spaces. For the so-called real-like class, the...
Uploaded on: December 3, 2022 -
March 24, 2010 (v1)Conference paper
[1] G. Ochoa, M. Tomassini, S. Verel, and C. Darabos, "A study of NK landscapes' basins and local optima networks," in Genetic and Evolutionary Computation Conference, GECCO 2008. ACM, 2008, pp. 555-562. [2] S. Verel, G. Ochoa, and M. Tomassini, "The connectivity of NK landscapes' basins: a network analysis," in Artificial Life XI: Proceedings...
Uploaded on: December 3, 2022 -
July 18, 2010 (v1)Conference paper
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 Problem (QAP). This network model is a reduction of the landscape in which the nodes correspond to the local optima, and the edges account for the notion of adjacency...
Uploaded on: December 3, 2022 -
July 7, 2012 (v1)Conference paper
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 space into a smaller mathematical object that is the graph having as vertices the local optima and as edges the possible weighted transitions between them. A new set...
Uploaded on: December 3, 2022 -
September 1, 2012 (v1)Conference paper
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 first step at combining these two tools to explore their ability to forecast the performance of search algorithms. We base our analysis on the Quadratic Assignment...
Uploaded on: December 2, 2022