期刊名称:Journal of Computational Science and Technology
电子版ISSN:1881-6894
出版年度:2013
卷号:7
期号:2
页码:196-204
DOI:10.1299/jcst.7.196
出版社:The Japan Society of Mechanical Engineers
摘要:Grammatical Evolution (GE), which is one of evolutionary computations, can find the function or the executable program or program fragment that will achieve a good fitness value for the given objective function to be minimized. This paper describes the use of the Stochastic Schemata Exploiter (SSE) for improving the convergence property of the original GE. The convergence property of the original GE and the improved GE algorithms is compared in the symbolic regression problem. The results show that the Grammatical Evolution using Stochastic Schemata Exploiter (GE-SSE) has the faster convergence speed than the original GE.
关键词:Grammatical Evolution (GE);Stochastic Schemata Exploiter (SSE);Backus-Naur Form (BNF);Symbolic Regression Problem