ABSTRACT
This paper describes initial testing of a novel idea to combine a CGP with an EDA. In recent work a new improved crossover technique was successfully applied to a CGP. To implement the new method meant changing the traditional CGP representation. The new representation developed in that work lends itself very nicely to some probability distribution being implemented. The work in this paper has investigated this idea of incoporating estimated probability distributions into the new CGP method with crossover.
- J. Clegg, J.A. Walker, J.F. Miller. A new crossover technique for Cartesian Genetic Programming . In Proceedings of the 2007 Genetic and Evolutionary Computation Conference, pages 1580--1587, London, 2007. Google ScholarDigital Library
- J. F. Miller and P. Thomson. Cartesian genetic programming. In Proceedings of the 3rd European Conference on Genetic Programming (EuroGP 2000), volume 1802 of Lecture Notes in Computer Science, pages 121--132, Edinburgh, 2000. Springer-Verlag. Google ScholarDigital Library
- A. Ratle and M. Sebag. Avoiding the bloat with stochastic grammer-based genetic programming. In Artificial Evolution - Lecture notes in computer science vol 2310, pages 255--266, Springer 2002. Google ScholarDigital Library
- R. Salustowicz and J. Schmidhuber. Probabilistic incremental program evolution. In Evolutionary Computation, (5) pages 123--141, 1997. Google ScholarDigital Library
Index Terms
- Combining cartesian genetic programming with an estimation of distribution algorithm
Recommendations
A new crossover technique for Cartesian genetic programming
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationGenetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped to create the offspring. Later Miller and Thomson introduced Cartesian Genetic ...
Solving real-valued optimisation problems using cartesian genetic programming
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationClassical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to real-valued function optimisation. Both of these techniques directly evolve the real-values that are the arguments of the real-valued function. In this ...
A comparison of Cartesian genetic programming and linear genetic programming
EuroGP'08: Proceedings of the 11th European conference on Genetic programmingTwo prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for constructing a directed acyclic graph (DAG) from a classical LGP instruction ...
Comments