DocumentCode
412555
Title
Fitness distance correlation in genetic programming: a constructive counterexample
Author
Vanneschi, Leonardo ; Tomassini, Marco ; COLLARD, Philippe ; Clergue, Manuel
Author_Institution
Comput. Sci. Inst., Lausanne Univ., Switzerland
Volume
1
fYear
2003
fDate
8-12 Dec. 2003
Firstpage
289
Abstract
The fitness distance correlation coefficient has been shown to be a reasonable measure to quantify problem difficulty in genetic algorithms and genetic programming for a wide set of problems. In this paper we present an hand-tailored function for which fitness distance correlation fails to correctly predict problem difficulty in genetic programming. This counterexample proves that fitness distance correlation, although reliable, is not an infallible measure to quantify problem difficulty.
Keywords
genetic algorithms; statistical analysis; constructive counterexample; fitness distance correlation coefficient; genetic algorithms; genetic programming; hand-tailored function; infallible measure; problem difficulty; Algorithm design and analysis; Genetic algorithms; Genetic mutations; Genetic programming; Hamming distance; Laboratories; Sampling methods; Statistics; Stochastic processes; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN
0-7803-7804-0
Type
conf
DOI
10.1109/CEC.2003.1299587
Filename
1299587
Link To Document