DagSemProc.10361.2.pdf
- Filesize: 265 kB
- 20 pages
Document
2-bit Flip Mutation Elementary Fitness Landscapes
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 10361
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2010-11-24
Cite AsGet BibTex
William Langdon. 2-bit Flip Mutation Elementary Fitness Landscapes. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 10361, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.10361.2
https://doi.org/10.4230/DagSemProc.10361.2
Abstract
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.
Keywords
- Genetic Algorithms
- Genetic Programming
- search
- optimisation
- graph theory
- Laplacian
- Hamming cube
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads