2019
DOI: 10.1007/s10710-019-09360-6
|View full text |Cite
|
Sign up to set email alerts
|

Cartesian genetic programming: its status and future

Abstract: Cartesian genetic programming, a well-established method of genetic programming, is approximately 20 years old. It represents solutions to computational problems as graphs. Its genetic encoding includes explicitly redundant genes which are wellknown to assist in effective evolutionary search. In this article, we review and compare many of the important aspects of the method and findings discussed since its inception. In the process, we make many suggestions for further work which could improve the efficiency o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 75 publications
(36 citation statements)
references
References 102 publications
0
31
0
Order By: Relevance
“…CGP is a subtype of EAs, which generates directed acyclic computational configurations of nodes. Like other types of EAs, it uses trees as its solution representation (Miller, 2020 ). CGP can evolve symbolic expressions, Boolean logic circuits, and artificial neural networks.…”
Section: Methodsmentioning
confidence: 99%
“…CGP is a subtype of EAs, which generates directed acyclic computational configurations of nodes. Like other types of EAs, it uses trees as its solution representation (Miller, 2020 ). CGP can evolve symbolic expressions, Boolean logic circuits, and artificial neural networks.…”
Section: Methodsmentioning
confidence: 99%
“…Genes that make up the genotype (individual representations) in CGP are integers representing where a node receives its data at inputs, the actions on the data are performed at the node. The output data appears at the output of nodes for processing of the following nodes [32][33].…”
Section: Cartesian Genetic Programmingmentioning
confidence: 99%
“…In particular, it is a popular and easily adaptable representation method for the solution of many problems. Also CGP is an appropriate method of GP to represent many computational process such as equations, state machines, neural networks, algorithms, and electronic circuits [33].…”
Section: Cartesian Genetic Programmingmentioning
confidence: 99%
“…Cartesian genetic programming (CGP) [49] encodes graphs with linear or grid-based genotypes and produces new ones by evolving the initial graph, originally used produce electronic circuits. A recent line of work [7,8] introduced evolving graphs by graph programming, CGP's generalization to arbitrary graphs.…”
Section: Learning-based Graph Generationmentioning
confidence: 99%