Abstract: In this contribution we investigate the evolution of operators for Genetic Programming by means of Genetic Programming. Metaevolution of recombination operators in graph-based GP is applied and compared to other methods for the variation of recombination operators in graph-based GP. We demonstrate that a straightforward application of recombination operators onto themselves does not work well. After introducing an additional level of recombination operators (the meta level) which are recombining a pool of recombination operators, even self-recombination on the additional level becomes feasible.We show that the overall performance of this system is better than in other variants of graph GP. As a test problem we use speaker recognition.
External IDs:dblp:conf/eurogp/KantschikDBB99
Loading