Two New Mutation Techniques for Cartesian Genetic Programming

Roman Kalkreuth

2019

Abstract

Cartesian Genetic Programming is often used with a point mutation as the sole genetic operator. In this paper, we propose two phenotypic mutation techniques and take a step towards advanced phenotypic mutations in Cartesian Genetic Programming. The functionality of the proposed mutations is inspired by biological evolution which mutates DNA sequences by inserting and deleting nucleotides. Experiments with boolean functions problem show a better search performance when the proposed mutations are used. The results of our experiments indicate that the proposed mutations are beneficial for the use of Cartesian Genetic Programming.

Paper Citation

in Harvard Style

Kalkreuth R. (2019). Two New Mutation Techniques for Cartesian Genetic Programming. In Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - Volume 1: ECTA; ISBN 978-989-758-384-1, SciTePress, pages 82-92. DOI: 10.5220/0008070100820092

in Bibtex Style

@conference{ecta19,
author={Roman Kalkreuth},
title={Two New Mutation Techniques for Cartesian Genetic Programming},
booktitle={Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - Volume 1: ECTA},
year={2019},
pages={82-92},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008070100820092},
isbn={978-989-758-384-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - Volume 1: ECTA
TI - Two New Mutation Techniques for Cartesian Genetic Programming
SN - 978-989-758-384-1
AU - Kalkreuth R.
PY - 2019
SP - 82
EP - 92
DO - 10.5220/0008070100820092
PB - SciTePress