Positional independence and recombination in cartesian genetic programming

Authors:
Xinye Cai;Stephen L. Smith;Andy M. Tyrrell
Affiliations:
Department of Electronics, The University of York, Heslington, UK;Department of Electronics, The University of York, Heslington, UK;Department of Electronics, The University of York, Heslington, UK
Venue:
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Year:
2006

Citing 11
Cited 3

An adaptive crossover distribution mechanism for genetic algorithms

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
A compiling genetic programming system that directly manipulates the machine code

Advances in genetic programming
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms

Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Principles in the Evolutionary Design of Digital Circuits—Part I

Genetic Programming and Evolvable Machines
Biomimetic Representation with Genetic Programming Enzyme

Genetic Programming and Evolvable Machines
RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
Cartesian Genetic Programming

Proceedings of the European Conference on Genetic Programming
Empirical studies of the genetic algorithm with noncoding segments

Evolutionary Computation
Code growth, explicitly defined introns, and alternative selection schemes

Evolutionary Computation

Advanced techniques for the creation and propagation of modules in cartesian genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
A survey and taxonomy of performance improvement of canonical genetic programming

Knowledge and Information Systems
Implicit context representation Cartesian genetic programming for the assessment of visuo-spatial ability

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Previously, recombination (or crossover) has proved to be unbene-ficial in Cartesian Genetic Programming (CGP). This paper describes the implementation of an implicit context representation for CGP in which the specific location of genes within the chromosome has no direct or indirect influence on the phenotype. Consequently, recombination has a beneficial effect and is shown to outperform conventional CGP in the even-3 parity problem.