mGGA: The meta-Grammar Genetic Algorithm

@inproceedings{ONeill2005mGGATM,
  title={mGGA: The meta-Grammar Genetic Algorithm},
  author={Michael O'Neill and Anthony Brabazon},
  booktitle={EuroGP},
  year={2005}
}
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. 
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Grammar model-based program evolution

Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) • 2004
View 1 Excerpt

Genetic Programming IV

Genetic Programming Series • 2003
View 1 Excerpt

Grammatical Evolution

Genetic Programming Series • 2003
View 2 Excerpts

Representations for genetic and evolutionary algorithms

Studies in Fuzziness and Soft Computing • 2002
View 1 Excerpt

Automatic Programming in an Arbitrary Language: Evolving Programs in Grammatical Evolution

M. O’Neill
PhD thesis, University of Limerick • 2001
View 1 Excerpt

The language instinct: the new science of language and the mind

S. Pinker
1995
View 1 Excerpt

Similar Papers

Loading similar papers…