A New Subgraph Crossover for Cartesian Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.7970
- @InProceedings{Kalkreuth:2017:EuroGP,
-
author = "Roman Kalkreuth and Guenter Rudolph and
Andre Droschinsky",
-
title = "A New Subgraph Crossover for Cartesian Genetic
Programming",
-
booktitle = "EuroGP 2017: Proceedings of the 20th European
Conference on Genetic Programming",
-
year = "2017",
-
month = "19-21 " # apr,
-
editor = "Mauro Castelli and James McDermott and
Lukas Sekanina",
-
series = "LNCS",
-
volume = "10196",
-
publisher = "Springer Verlag",
-
address = "Amsterdam",
-
pages = "294--310",
-
organisation = "species",
-
keywords = "genetic algorithms, genetic programming, Cartesian
Genetic Programming: Poster",
-
isbn13 = "978-3-319-55695-6",
-
DOI = "doi:10.1007/978-3-319-55696-3_19",
-
abstract = "While tree-based Genetic Programming is often used
with crossover, Cartesian Genetic Programming is mostly
used only with mutation as genetic operator. In this
paper, a new crossover technique is introduced which
recombines subgraphs of two selected graphs.
Experiments on symbolic regression, boolean functions
and image operator design problems indicate that the
use of the subgraph crossover improves the search
performance of Cartesian Genetic Programming. A
preliminary comparison to a former proposed crossover
technique indicates that the subgraph crossover
performs better on our tested problems.",
-
notes = "Part of \cite{Castelli:2017:GP} EuroGP'2017 held
inconjunction with EvoCOP2017, EvoMusArt2017 and
EvoApplications2017",
- }
Genetic Programming entries for
Roman Tobias Kalkreuth
Guenter Rudolph
Andre Droschinsky
Citations