2012
DOI: 10.1007/978-3-642-23229-9_8
|View full text |Cite
|
Sign up to set email alerts
|

A Comprehensive Survey on Fitness Landscape Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
117
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 160 publications
(117 citation statements)
references
References 60 publications
0
117
0
Order By: Relevance
“…However, formally distinguishing the statistical behaviour of EAs on a given topology is an uncertain process itself that requires rigorous statistical experiments (see Section 2.3 and Back et al, 1997;Bayer and Finkel, 2004;Goh and Tan, 2009;Goldberg, 2002;Hadka and Reed, 2012;Matott et al, 2012). As such, the most common motivation for assessing the problem characteristics through fitness landscape analysis is to gain a better understanding of optimisation algorithm performance on a given set of problems (Pitzer and Affenzeller, 2012). Jones (1995) and Stadler (2002) provide a formal definition of the fitness landscape, where the landscape is defined as a directed graph, where the nodes correspond to solutions, and the edges (connections) to search operator manoeuvres.…”
Section: Characterisation Of Fitness Landscape Propertiesmentioning
confidence: 99%
See 3 more Smart Citations
“…However, formally distinguishing the statistical behaviour of EAs on a given topology is an uncertain process itself that requires rigorous statistical experiments (see Section 2.3 and Back et al, 1997;Bayer and Finkel, 2004;Goh and Tan, 2009;Goldberg, 2002;Hadka and Reed, 2012;Matott et al, 2012). As such, the most common motivation for assessing the problem characteristics through fitness landscape analysis is to gain a better understanding of optimisation algorithm performance on a given set of problems (Pitzer and Affenzeller, 2012). Jones (1995) and Stadler (2002) provide a formal definition of the fitness landscape, where the landscape is defined as a directed graph, where the nodes correspond to solutions, and the edges (connections) to search operator manoeuvres.…”
Section: Characterisation Of Fitness Landscape Propertiesmentioning
confidence: 99%
“…Based on this definition, the fitness landscape is not only dependent upon the problem to be solved, but also the choice of algorithm through its parameterised search operators. In some cases, the landscape defined by an operator is strongly related (or even equivalent) to the topological distance between solutions in the decision space (Moraglio and Poli, 2004), for which cases it may be sufficient to study the fitness landscape as defined by the topology of the fitness function (Pitzer and Affenzeller, 2012). Despite the intimate link between a problem's fitness function and the induced algorithm behaviour (as indicated by the connecting arrow in Figure 2), this section discusses issues associated with the characterisation of the landscape properties (as they depend on the topology defined by algorithm operators), and Section 2.3 focusses on the temporal characterisation of an algorithm's run-time search behaviour.…”
Section: Characterisation Of Fitness Landscape Propertiesmentioning
confidence: 99%
See 2 more Smart Citations
“…The fitness landscape analysis, in the metaheuristics community, can be a promising idea for this purpose (He et al 2007). According to Pitzer and Affenzeller (2012), the fitness landscape analysis is commonly used to better understand the performance and the progression "through the landscape" of a given heuristic on a problem instances (Pitzer and Affenzeller 2012). The use of such a concept allows characterizing local optima, plateaus, basins of attraction, and barriers.…”
Section: Which Metaheuristic For Which Problem?mentioning
confidence: 99%