A Self-Selecting Crossover Operator
This paper compares the efficacy of different crossover operators for Grammatical Evolution across a typical numeric regression problem and a typical data classification problem. Grammatical evolution is an extension of genetic programming, in that it is an algorithm for evolving complete programs i...
Saved in:
Published in | 2006 IEEE International Conference on Evolutionary Computation pp. 1420 - 1427 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
2006
|
Subjects | |
Online Access | Get full text |
ISBN | 9780780394872 0780394879 |
ISSN | 1089-778X |
DOI | 10.1109/CEC.2006.1688475 |
Cover
Loading…
Summary: | This paper compares the efficacy of different crossover operators for Grammatical Evolution across a typical numeric regression problem and a typical data classification problem. Grammatical evolution is an extension of genetic programming, in that it is an algorithm for evolving complete programs in an arbitrary language. Each of the two main crossover operators struggles (for different reasons) to achieve 100% correct solutions. A mechanism is proposed, allowing the evolutionary algorithm to self-select the type of crossover utilised and this is shown to improve the rate of generating 100% successful solutions. |
---|---|
ISBN: | 9780780394872 0780394879 |
ISSN: | 1089-778X |
DOI: | 10.1109/CEC.2006.1688475 |