Grammar-based Genetic Programming: a survey

作者：McKay Robert I^*; Nguyen Xuan Hoai; Whigham Peter Alexander; Shan Yin; O'Neill Michael

来源：Genetic Programming and Evolvable Machines, 2010, 11(3-4): 365-396.

DOI：10.1007/s10710-010-9109-y

• Genetic programming
• Evolutionary computation
• Grammar
• Context free
• Regular
• Tree adjoining

Grammar formalisms are one of the key representation structures in Computer Science. So it is not surprising that they have also become important as a method for formalizing constraints in Genetic Programming (GP). Practical grammar-based GP systems first appeared in the mid 1990s, and have subsequently become an important strand in GP research and applications. We trace their subsequent rise, surveying the various grammar-based formalisms that have been used in GP and discussing the contributions they have made to the progress of GP. We illustrate these contributions with a range of applications of grammar-based GP, showing how grammar formalisms contributed to the solutions of these problems. We briefly discuss the likely future development of grammar-based GP systems, and conclude with a brief summary of the field.

• 出版日期2010-9