A Grammar-Based Genetic Algorithm

author = "Hendrik James Antonisse",

title = "A Grammar-Based Genetic Algorithm",

pages = "193--204",

ISBN = "1-55860-170-8",

editor = "Gregory J. E. Rawlins",

booktitle = "Foundations of Genetic Algorithms",

month = "15--18 " # jul # " 1990",

address = "Indiana University, Bloomington, USA",

publisher = "Morgan Kaufmann",

publisher_address = "San Mateo",

keywords = "genetic algorithms, genetic programming, inductive bias, high-level representations, crossover",

year = "1991",

DOI = "

doi:10.1016/B978-0-08-050684-5.50015-X",

abstract = "High-level syntactically-based representations pose problems for applying the GA because it is hard to construct crossover operators that always result in legal offspring. This paper proposes a reformulation of the genetic algorithm that makes it appropriate to any representation that can be cast in a formal grammar. This reformulation is consistent with recent reinterpretations of GA foundations in set-theoretic terms, and concentrates on the modifications required to make the space of legal structures closed under the crossover operator. The analysis places no restriction on the form of the grammars.",

notes = "FOGA-90 Published in 1991. cited by \cite{bruhn:2002:ECJ} grammar-based crossover, parity. K-armed bandit",