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.
@InProceedings{langdon:DagSemProc.10361.2, author = {Langdon, William}, title = {{2-bit Flip Mutation Elementary Fitness Landscapes}}, booktitle = {Theory of Evolutionary Algorithms}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10361}, editor = {Anne Auger and Jonathan L. Shapiro and L. Darrell Whitley and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10361.2}, URN = {urn:nbn:de:0030-drops-28146}, doi = {10.4230/DagSemProc.10361.2}, annote = {Keywords: Genetic Algorithms, Genetic Programming, search, optimisation, graph theory, Laplacian, Hamming cube} }
Feedback for Dagstuhl Publishing