Cartesian genetic programming: Difference between revisions

Revision as of 03:23, 12 January 2019

Revision as of 14:01, 9 February 2019

Line 1:

{{Evolutionary algorithms}}

'''Cartesian genetic programming''' is a form of [[genetic programming]], which uses a graph representation to encode computer programs. It grew from a method of evolving digital circuits developed by Miller et al. in 1997<ref>Miller, J.F., Thomson, P., Fogarty, T.C.: Designing Electronic Circuits Using Evolutionary Algorithms: Arithmetic Circuits: A Case Study. In: D. Quagliarella, J. Periaux, C. Poloni, G. Winter (eds.) Genetic Algorithms and Evolution Strategies in Engineering and Computer Science: Recent Advancements and Industrial Applications, pp. 105–131. Wiley (1998)</ref>. However the term ‘Cartesian genetic programming’ first appeared in 1999<ref> Miller, J.F.: An Empirical Study of the Efficiency of Learning Boolean Functions using a Cartesian Genetic Programming Approach. In: Proc. Genetic and Evolutionary Computation Conference, pp. 1135–1142. Morgan Kaufmann (1999)</ref> and was proposed as a general form of genetic programming in 2000<ref> Miller, J.F., Thomson, P.: Cartesian Genetic Programming. In: Proc. European Conference on Genetic Programming, LNCS, vol. 1802, pp. 121–132. Springer (2000)</ref>. It is called ‘Cartesian’ because it represents a program using a two-dimensional grid of nodes.

Genetic Programming, LNCS, vol. 1802, pp. 121–132. Springer (2000)</ref>. It is called ‘Cartesian’ because it represents a program using a two-dimensional grid of nodes.

Julian F. Miller (the inventor of CGP) has a web site<ref>{{Cite web|url=http://www.cartesiangp.com|title=CGP home|website=www.cartesiangp.com|access-date=2018-08-02}}</ref> which explains how CGP works. You can download many publications about CGP from this site. He also edited a book titled 'Cartesian Genetic Programming,<ref>{{Cite book|date=2011|editor-last=Miller|editor-first=Julian F.|title=Cartesian Genetic Programming|journal=Natural Computing Series|language=en-gb|doi=10.1007/978-3-642-17310-3|issn=1619-7127|isbn=978-3-642-17309-7|citeseerx=10.1.1.8.3777}}</ref>', published in 2011 by Springer.

== References ==