Grammar-based Genetic Programming: a survey

被引：0
作者：
Robert I. McKay
Nguyen Xuan Hoai
Peter Alexander Whigham
Yin Shan
Michael O’Neill
机构：
[1] Seoul National University,Structural Complexity Lab, School of Computer Science and Engineering
[2] Le Quy Don University,Department of Computer Science
[3] University of Otago,Department of Information Science
[4] Medicare Australia,Complex and Adaptive Systems Lab, School of Computer Science and Informatics
[5] University College Dublin,undefined
来源：
Genetic Programming and Evolvable Machines | 2010年 / 11卷
关键词：
Genetic programming; Evolutionary computation; Grammar; Context free; Regular; Tree adjoining;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：365 / 396
页数：31
相关论文
共 57 条
[1]  
Bruhn P.(2002)Genetic programming over context-free languages with linear constraints for the knapsack problem: first results Evol. Comput. 10 51-74
[2]  
Geyer-Schulz A.(1990)A survey of adaptable grammars SIGPLAN Not. 25 35-44
[3]  
Christiansen H.(1994)Evolutionary learning of novel grammars for design improvement AIEDAM 8 83-94
[4]  
Gero J.(1989)Messy genetic algorithms: motivation, analysis and first results Complex Syst. 3 493-530
[5]  
Goldberg D.(1994)Automatic definition of modular neural networks Adapt. Behav. 3 151-183
[6]  
Korb B.(2006)Representation and structural difficulty in genetic programming IEEE Trans. Evol. Comput. 10 157-166
[7]  
Deb K.(2004)Functional scalability through generative representations: the evolution of table designs Environ. Plann. B: Plann. Des. 31 569-587
[8]  
Gruau F.(1975)Tree adjunct grammars J. Comput. Syst. Sci. 10 136-163
[9]  
Hoai N.X.(2001)Variants of genetic programming for species distribution modelling—fitness sharing, partial functions, population evaluation Ecol. Model. 146 231-241
[10]  
McKay R.I.(2006)Model-building with interpolated temporal data Ecol. Inform. 1 259-268
123456