Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)
DOI: 10.1109/cec.2002.1007059
|View full text |Cite
|
Sign up to set email alerts
|

Crossover and bloat in the functionality model of enzyme genetic programming

Abstract: Abstract-The functionality model is a new approach in enzyme genetic programming which enables the evolution of variable length solutions whilst preserving local context. This paper introduces the model and presents an analysis of crossover and the evolution of program size.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…For both transfer and remove operations, the number of components targeted is chosen randomly within an upper limit (t u ). The benefits of this form of crossover over uniform and tree-based crossovers is discussed in Lones and Tyrrell (2002b). Mutation targets both functionalities (m f ) and activities (m a ).…”
Section: Evolving Program Representationsmentioning
confidence: 99%
“…For both transfer and remove operations, the number of components targeted is chosen randomly within an upper limit (t u ). The benefits of this form of crossover over uniform and tree-based crossovers is discussed in Lones and Tyrrell (2002b). Mutation targets both functionalities (m f ) and activities (m a ).…”
Section: Evolving Program Representationsmentioning
confidence: 99%
“…Note that with Tantrix-GA's standard (indirect) coding and no slack, there are many flat plateaus, indicating neutral local landscapes. Provided that these plateaus are not too large, they can be advantageous for evolutionary search [12,19,14,15]. With the addition of more slack, the plateaus shrink.…”
Section: A More Direct Representationmentioning
confidence: 99%
“…Bloating is an inherent GP problem and represents the accelerated growth of the trees in successive generations (Langdon and Poli, 1998;Lones and Tyrrell, 2002). This problem also relates to the execution time problem, because larger programs consume more resources.…”
mentioning
confidence: 99%