Parallel Grammatical Evolution with Backward Processing

This paper describes parallel grammatical evolution (PGE) that can evolve complete programs using a variable length linear genome to govern the mapping of a Backus Naur form grammar definition. To increase the efficiency of grammatical evolution (GE) the influence of backward processing was tested. The significance of backward coding (BC) and the comparison with standard coding of GEs is presented. BC can speed up grammatical evolution with high quality features. The adaptive significance of parallel grammatical evolution with "male" and "female" populations has been studied

[1]  Wojciech Piaseczny,et al.  Chemical genetic programming - evolution of amino acid rewriting rules used for genotype-phenotype translation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[2]  W. K. Purves.  Life: The Science of Biology , 1985 .

[3]  Anthony Brabazon,et al.  The automatic generation of programs for classification problems with grammatical swarm , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[4]  P. Osmera,et al.  Multilevel distributed genetic algorithms , 1995 .

[5]  Michael O'Neill,et al.  Grammatical evolution - evolutionary automatic programming in an arbitrary language , 2003, Genetic programming.