Positional Cartesian Genetic Programming

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

@Misc{Wilson:2018:arxiv,

• author = "Dennis George Wilson and Julian F. Miller and Sylvain Cussat-Blanc and Herve Luga",
• title = "Positional Cartesian Genetic Programming",
• year = "2018",
• month = "9 " # oct,
• keywords = "genetic algorithms, genetic programming, cartesian genetic programming",
• bibsource = "DBLP, http://dblp.uni-trier.de/db/journals/corr/corr1810.html#abs-1810-04119",
• URL = "http://arxiv.org/abs/1810.04119",
• size = "13 pages",
• abstract = "Cartesian Genetic Programming (CGP) has many modifications across a variety of implementations, such as recursive connections and node weights. Alternative genetic operators have also been proposed for CGP, but have not been fully studied. In this work, we present a new form of genetic programming based on a floating point representation. In this new form of CGP, called Positional CGP, node positions are evolved. This allows for the evaluation of many different genetic operators while allowing for previous CGP improvements like recurrency. Using nine benchmark problems from three different classes, we evaluate the optimal parameters for CGP and PCGP, including novel genetic operators.",

}

Genetic Programming entries for Dennis G Wilson Julian F Miller Sylvain Cussat-Blanc Herve Luga

Citations