eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2010-11-24
1
0
10.4230/DagSemProc.10361.2
article
2-bit Flip Mutation Elementary Fitness Landscapes
Langdon, William
Genetic Programming parity is not elementary.
GP parity cannot be represented as the sum of a small number
of elementary landscapes.
Statistics, including fitness distance correlation,
of Parity's fitness landscape are calculated.
Using Walsh analysis the
eigen values and eigenvectors of the Laplacian of the two bit flip
fitness landscape are given
and a ruggedness measure for elementary landscapes is proposed.
An elementary needle in a haystack (NIH) landscape is given.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10361/DagSemProc.10361.2/DagSemProc.10361.2.pdf
Genetic Algorithms
Genetic Programming
search
optimisation
graph theory
Laplacian
Hamming cube