Grammatical evolution

被引：498

作者：

O'Neill, M ^{[1
]}

Ryan, C ^{[1
]}

机构：

[1] Univ Limerick, Dept Comp Sci & Informat Syst, Limerick, Ireland

来源：

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION | 2001年 / 5卷 / 04期

关键词：

automatic programming; Backus-Naur form; degenerate code; evolutionary algorithms; neutral networks;

D O I：

10.1109/4235.942529

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We present grammatical evolution, an evolutionary algorithm that can evolve complete programs in an arbitrary language using a variable-length binary string. The binary genome determines which production rules in a Backus-Naur form grammar definition are used in a genotype-to-phenotype mapping process to a program. We demonstrate how expressions and programs of arbitrary complexity may be evolved and compare its performance to genetic programming.

引用

页码：349 / 358

页数：10

共 36 条

[1]

[Anonymous], LECT NOTES COMPUTER

[2]

[Anonymous], FDN GENETIC ALGORITH

[3]

[Anonymous], LATE BREAKING PAPERS

[4] Revisiting the GEMGA: Scalable evolutionary optimization through linkage learning [J].

Bandyopadhyay, S ;

Kargupta, H ;

Wang, G .

1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :603-608

[5]

Banzhaf W, 1994, LECT NOTES COMPUT SC, V866, P322

[6]

DEJONG KA, 1993, FDN GENETIC ALGORITH, V2, P19

[7]

Elseth G. D., 1995, PRINCIPLES MODERN GE

[8]

FRASER A, 1992, GENETIC PROGRAMMING

[9]

Freeman J. J., 1998, Genetic Programming 1998. Proceedings of the Third Annual Conference, P72

[10]

GOLDENBERG DM, 1993, INT J ONCOL, V3, P5

← 1 2 3 4 →