Detail publikace

Investigating the Influence of Mutation Operators in Cartesian Genetic Programming

Originální název

Investigating the Influence of Mutation Operators in Cartesian Genetic Programming

Anglický název

Investigating the Influence of Mutation Operators in Cartesian Genetic Programming

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@inproceedings{BUT28841,
  author="Ladislav {Čapka} and Zdeněk {Vašíček}",
  title="Investigating the Influence of Mutation Operators in Cartesian Genetic Programming",
  annote="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.",
  address="Faculty of Mechanical Engineering BUT",
  booktitle="13th International Conference on Soft Computing",
  chapter="28841",
  howpublished="print",
  institution="Faculty of Mechanical Engineering BUT",
  year="2007",
  month="august",
  pages="43--47",
  publisher="Faculty of Mechanical Engineering BUT",
  type="conference paper"
}