Abstract
A novel Grammatical Genetic Algorithm, the meta-Grammar Genetic Algorithm (mGGA) is presented. The mGGA borrows a grammatical representation and the ideas of modularity and reuse from Genetic Programming, and in particular an evolvable grammar representation from Grammatical Evolution by Grammatical Evolution. We demonstrate its application to a number of benchmark problems where significant performance gains are achieved when compared to static grammars. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
O’Neill, M., & Brabazon, A. (2005). mGGA: The meta-Grammar Genetic Algorithm. In Lecture Notes in Computer Science (Vol. 3447, pp. 311–320). Springer Verlag. https://doi.org/10.1007/978-3-540-31989-4_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
