By the same authors

From the same journal

From the same journal

Redundancy and computational efficiency in Cartesian genetic programming

Research output: Contribution to journalArticle

Author(s)

Department/unit(s)

Publication details

JournalIEEE Transactions on Evolutionary Computation
DatePublished - Apr 2006
Issue number2
Volume10
Number of pages8
Pages (from-to)167-174
Original languageEnglish

Abstract

The graph-based Cartesian genetic programming system has an unusual genotype representation with a number of advantageous properties. It has a form of redundancy whose role has received little attention in the published literature. The representation has genes that can be activated or deactivated by mutation operators during evolution. It has been demonstrated that this "junk" has a useful role and is very beneficial in evolutionary search. The results presented demonstrate the role of mutation and genotype length in the evolvability of the representation. It is found that the most evolvable representations occur when the genotype is extremely large and in which over 95% of the genes are inactive.

    Research areas

  • Cartesian genetic programming (CGP), code bloat, genetic programming, graph-based representations, introns, NEUTRALITY, ADAPTATION, LANDSCAPE, EVOLUTION

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations