Grammatical Evolution (GE), which is one of the evolutionary computations, aims to find function, program or program segment satisfying the design objective. This paper describes the improvement of the Grammatical Evolution according to Stochastic Schemata Exploiter (GE-SSE) and its application to symbolic regression problem. Firstly, GE-SSE is compared with original GE in symbolic regression p...

GRAPE is an implementation of Grammatical Evolution (GE) in DEAP, Evolutionary Computation framework Python, which consists the necessary classes and functions to evolve a population grammar-based solutions, while reporting essential measures. This tool was developed at Bio-computing Developmental Systems (BDS) Research Group, birthplace GE, as easy use (compared canonical C++ implementation, l...

The research presented in the paper forms part of a larger initiative aimed at automatic algorithm induction using machine learning. This paper compares the performance of two machine learning techniques, namely, genetic programming and a variation of genetic programming, grammatical evolution, for automatic algorithm induction. The application domain used to evaluate both the approaches is the...

We describe an R package which implements grammatical evolution (GE) for automatic program generation. By performing an unconstrained optimisation over a population of R expressions generated via a user-defined grammar, programs which achieve a desired goal can be discovered. The package facilitates the coding and execution of GE programs, and supports parallel execution. In addition, three app...

The aim of this work is to develop an Automatic Programming system drawing inspiration from biological genetic systems. Grammatical Evolution (GE), a system which can generate code in any language from variable length binary strings is the result of this investigation. Using a language definition in the form of a Backus Naur Form grammar permits the generation of programs in any language, of ar...

Grammatical evolution is an evolutionary algorithm designed to evolve programs in any language. Grammatical evolution operates on binary strings and the mapping of the genotype onto the phenotype (the tree representation of the programs) is provided through the grammar described in the form of production rules. The program trees are constructed in a pre-order fashion, which means that as the ge...