Publication Details
Investigating the Influence of Mutation Operators in Cartesian Genetic Programming
Cartesian Genetic Programming, mutation operator, mutation efficiency, digital circuit evolution
This paper deals with an analysis of various mutation operators used in cartesian genetic programming. The
aim is to compare and evaluate the efficiency of a usually used mutation operator introduced by J. Miller that
manipulates with genes and a new binary mutation operator. While the standard mutation operator is convenient
for implementations in software, the binary mutation method is more suitable in case of hardware realizations of
cartesian genetic programming because it does not require the knowledge of chromosome (configuration string,
respectively) structure. Besides the binary mutation operator, another variation of this binary mutation was
evaluated. This operator manipulates with a group of neighboring bits.
@INPROCEEDINGS{FITPUB8445, author = "Ladislav \v{C}apka and Zden\v{e}k Va\v{s}\'{i}\v{c}ek", title = "Investigating the Influence of Mutation Operators in Cartesian Genetic Programming", pages = "43--47", booktitle = "13th International Conference on Soft Computing", year = 2007, location = "Brno, CZ", publisher = "Faculty of Mechanical Engineering BUT", ISBN = "978-80-214-3473-8", language = "english", url = "https://www.fit.vut.cz/research/publication/8445" }