A new crossover technique for Cartesian genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.7630

@InProceedings{1277276,

• author = "Janet Clegg and James Alfred Walker and Julian Francis Miller",
• title = "A new crossover technique for Cartesian genetic programming",
• booktitle = "GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation",
• year = "2007",
• editor = "Dirk Thierens and Hans-Georg Beyer and Josh Bongard and Jurgen Branke and John Andrew Clark and Dave Cliff and Clare Bates Congdon and Kalyanmoy Deb and Benjamin Doerr and Tim Kovacs and Sanjeev Kumar and Julian F. Miller and Jason Moore and Frank Neumann and Martin Pelikan and Riccardo Poli and Kumara Sastry and Kenneth Owen Stanley and Thomas Stutzle and Richard A Watson and Ingo Wegener",
• volume = "2",
• isbn13 = "978-1-59593-697-4",
• pages = "1580--1587",
• address = "London",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco2007/docs/p1580.pdf",
• DOI = "doi:10.1145/1276958.1277276",
• publisher = "ACM Press",
• publisher_address = "New York, NY, USA",
• month = "7-11 " # jul,
• organisation = "ACM SIGEVO (formerly ISGEC)",
• keywords = "genetic algorithms, genetic programming, Cartesian Genetic Programming, crossover techniques, optimisation",
• abstract = "Genetic 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 Programming, which uses directed graphs as a representation to replace the tree structures originally introduced by Koza. Cartesian Genetic Programming has been shown to perform better than the traditional Genetic Programming; but it does not use crossover to create offspring, it is implemented using mutation only. In this paper a new crossover method in Genetic Programming is introduced. The new technique is based on an adaptation of the Cartesian Genetic Programming representation and is tested on two simple regression problems. It is shown that by implementing the new crossover technique, convergence is faster than that of using mutation only in the Cartesian Genetic Programming method.",
• notes = "GECCO-2007 A joint meeting of the sixteenth international conference on genetic algorithms (ICGA-2007) and the twelfth annual genetic programming conference (GP-2007).

  ACM Order Number 910071",

}

Genetic Programming entries for Janet Clegg James Alfred Walker Julian F Miller

Citations