On the mapping of genotype to phenotype in evolutionary algorithms

20Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Analogies with molecular biology are frequently used to guide the development of artificial evolutionary search. A number of assumptions are made in using such reasoning, chief among these is that evolution in natural systems is an optimal, or at least best available, search mechanism, and that a decoupling of search space from behaviour encourages effective search. In this paper, we explore these assumptions as they relate to evolutionary algorithms, and discuss philosophical foundations from which an effective evolutionary search can be constructed. This framework is used to examine grammatical evolution (GE), a popular search method that draws heavily upon concepts from molecular biology. We identify several properties in GE that are in direct conflict with those that promote effective evolutionary search. The paper concludes with some recommendations for designing representations for effective evolutionary search.

Cite

CITATION STYLE

APA

Whigham, P. A., Dick, G., & Maclaurin, J. (2017). On the mapping of genotype to phenotype in evolutionary algorithms. Genetic Programming and Evolvable Machines, 18(3), 353–361. https://doi.org/10.1007/s10710-017-9288-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free