The concept of fitness landscape (or adaptive landscape) was introduce par S. Wright in the field of evolutionary biology in 1930's. It is one of the most relevant to explain the evolution of individuals. In the field of combinatorial optimization by metaheuristic, it is also used and allows to study the link between geometrical description of...
-
December 12, 2005 (v1)PublicationUploaded on: February 28, 2023
-
July 8, 2009 (v1)Conference paper
The performances of evolutionary algorithms (genetics algorithms, genetic programming, etc.) or local search algotihms (Simulated annealing, tabu search, etc.) depends on the properties of seach space structure. One concept to analyse the search space is the fitness landscapes in which the problem to optimize and the search algorithm are taken...
Uploaded on: December 3, 2022 -
July 7, 2012 (v1)Conference paper
One of the most commonly-used metaphors to describe the process of heuristic search methods in solving combinatorial optimization problems is that of a fitness landscape. The landscape metaphor appears most commonly in work related to evolutionary algorithms, however, it can be used for search in general; the search space can be regarded as a...
Uploaded on: February 22, 2023 -
July 8, 2009 (v1)Conference paper
The performances of evolutionary algorithms (genetics algorithms, genetic programming, etc.) or local search algotihms (Simulated annealing, tabu search, etc.) depends on the properties of seach space structure. One concept to analyse the search space is the fitness landscapes in which the problem to optimize and the search algorithm are taken...
Uploaded on: February 22, 2023 -
July 7, 2012 (v1)Conference paper
One of the most commonly-used metaphors to describe the process of heuristic search methods in solving combinatorial optimization problems is that of a fitness landscape. The landscape metaphor appears most commonly in work related to evolutionary algorithms, however, it can be used for search in general; the search space can be regarded as a...
Uploaded on: December 3, 2022 -
July 6, 2013 (v1)Conference paper
One of the most commonly-used metaphors to describe the process of heuristic search methods in solving combinatorial optimization problems is that of a fitness landscape. The landscape metaphor appears most commonly in work related to evolutionary algorithms, however, it can be used for search in general; the search space can be regarded as a...
Uploaded on: December 2, 2022 -
July 18, 2010 (v1)Conference paper
One of the most commonly-used metaphors to describe the process of heuristic search methods in solving combinatorial optimisation problems is that of a fitness landscape. The landscape metaphor appears most commonly in work related to evolutionary algorithms, however, it can be used for search in general; the search space can be regarded as a...
Uploaded on: December 3, 2022 -
July 18, 2010 (v1)Conference paper
One of the most commonly-used metaphors to describe the process of heuristic search methods in solving combinatorial optimisation problems is that of a fitness landscape. The landscape metaphor appears most commonly in work related to evolutionary algorithms, however, it can be used for search in general; the search space can be regarded as a...
Uploaded on: February 22, 2023 -
July 7, 2007 (v1)Conference paper
International audience
Uploaded on: February 28, 2023 -
June 12, 2011 (v1)Conference paper
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 coordinate their local execution on distributed nodes in order to optimize the global performance of the distributed system. DAMS is based on three-layer architecture...
Uploaded on: December 3, 2022 -
October 19, 2009 (v1)Conference paper
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 NK landscapes as an example. In our case the inherent network is the graph whose vertices represent the local maxima in the landscape, and the edges account for the...
Uploaded on: December 3, 2022 -
December 8, 2003 (v1)Conference paper
Usually the offspring-parent fitness correlation is used to visualize and analyze some caracteristics of fitness landscapes such as evolvability. In this paper, we introduce a more general representation of this correlation, the Fitness Cloud (FC). We use the bottleneck metaphor to emphasise fitness levels in landscape that cause local search...
Uploaded on: February 28, 2023 -
May 1, 2018 (v1)Journal articleAn Iterated Local Search to find many solutions of the 6-states Firing Squad Synchronization Problem
This paper proposes an optimization approach for solving a classical problem in cellular automata theory: the 6-states Firing Squad Synchronization Problem (FSSP). To this purpose, we introduce an original optimization function which quantifies the quality of solutions according only to the main goal of the problem without taking into account...
Uploaded on: February 27, 2023 -
February 19, 2013 (v1)Book
Chacun peut observer dans le monde réel l'omniprésence de systèmes complexes constitués de nombreux éléments en interaction et dont les caractéristiques globales ne peuvent se réduire à celles de leurs composants : ce sont par exemple les cellules d'un organisme vivant, les colonies de fourmis, les écosystèmes, ou encore les systèmes...
Uploaded on: February 28, 2023 -
September 11, 2010 (v1)Conference paper
Choosing the suitable representation, the operators and the values of the parameters of an evolutionary algorithm is one of the main problems to design an efficient algorithm for one particular optimization problem. This additional information to the evolutionary algorithm generally is called the algorithm parameter, or parameter. This work...
Uploaded on: December 3, 2022 -
August 23, 2004 (v1)Conference paper
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 argued that the fitness cloud concept overcomes several deficiencies of the landscape representation. Our analysis is based on the correlation between fitness of...
Uploaded on: February 28, 2023 -
August 27, 2004 (v1)Conference paper
We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in many real-world problems. Despite the fact that natural evolution does not directly select for evolvability, the basic idea behind the scuba search heuristic is to explicitly...
Uploaded on: February 28, 2023 -
June 23, 2004 (v1)Conference paper
We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape. Despite the fact that natural evolution does not directly select for evolvability, the basic idea behind the scuba search heuristic is to explicitly push the evolvability...
Uploaded on: February 28, 2023 -
August 5, 2008 (v1)Conference paper
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 NK landscapes as an example. In our case the inherent network is the graph where the vertices represent the local maxima in the landscape, and the edges account for...
Uploaded on: December 4, 2022 -
July 8, 2006 (v1)Conference paper
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 problem. This work highlight a new characteristic of neutral fitness landscapes which allows to design new adapted metaheuristic.
Uploaded on: February 28, 2023 -
September 11, 2010 (v1)Conference paper
This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedy-ascent) hill-climbing algorithm, instead of a best-improvement (steepest-ascent) one, for the definition and extraction of the basins of attraction of the landscape optima. A statistical analysis...
Uploaded on: December 3, 2022 -
November 1, 2010 (v1)Journal article
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 graph which we call the local optima network. The vertices of this graph are the local optima of the given fitness landscape, while the arcs are transition...
Uploaded on: December 4, 2022 -
June 20, 2013 (v1)Conference paper
We start from the observation that theoretical studies of luxury consumption are relatively rare in the economic analysis. In fact, while homothetic preferences simply cannot address the issue of luxury consumption, the use of non-homothetic preferences is restricted, at least in standard models, by the absence of consensus about the nature of...
Uploaded on: February 28, 2023 -
December 2, 2006 (v1)Journal article
Evolutionary algorithms (EA) are optimization algorithms inspired by the neo-dar winian theory of evolution. Those algorithms use a population of potential solutions which is gradually guided towards better solutions discovered by random variation. The neutral theory of evolution considers that the majority of mutations are selectively neutral...
Uploaded on: February 28, 2023 -
December 24, 2008 (v1)Journal article
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 NK landscapes as an example. In our case the inherent network is the graph whose vertices represent the local maxima in the landscape, and the edges account for the...
Uploaded on: December 3, 2022