@inproceedings{c88afb9fa06e472a90fea17a035c4b7e,
title = "Crossover in grammatical evolution: A smooth operator?",
abstract = "Grammatical Evolution is an evolutionary algorithm which can produce code in any language, requiring as inputs a BNF grammar definition describing the output language, and the fitness function. The usefulness of crossover in GP systems has been hotly debated for some time, and this debate has also arisen with respect to Grammatical Evolution. This paper serves to analyse the crossover operator in our algorithm by comparing the performance of a variety of crossover operators. Results show that the standard one point crossover employed by Grammatical Evolution is not as destructive as it might originally appear, and is useful in performing a global search over the course of entire runs. This is attributed to the fact that prior to the crossover event the parent chromosomes undergo alignment which facilitates the swapping of blocks which are more likely to be in context.",
author = "Michael O{\textquoteright}Neill and Conor Ryan",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 3rd European Conference on Genetic Programming, EuroGP 2000 ; Conference date: 15-04-2000 Through 16-04-2000",
year = "2000",
doi = "10.1007/978-3-540-46239-2_11",
language = "English",
isbn = "3540673393",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "149--162",
editor = "Langdon, {William B.} and Peter Nordin and Riccardo Poli and Julian Miller and Wolfgang Banzhaf and Fogarty, {Terence C.}",
booktitle = "Genetic Programming - European Conference, EuroGP 2000 Edinburgh, Scotland, UK, April 15-16, 2000 Proceedings",
}