A Self-Tuning Mechanism for Depth-Dependent
Crossover
T. Ito, H. Iba, and S. Sato. Advances in Genetic Programming 3, chapter 16, MIT Press, Cambridge, MA, USA, (June 1999)
Abstract
There are three genetic operators: crossover, mutation
and reproduction in Genetic Programming (GP). Among
these genetic operators, the crossover operator mainly
contributes to searching for a solution program.
Therefore, we aim at improving the program generation
by extending the crossover operator. The normal
crossover selects crossover points randomly and
destroys building blocks. We think that building blocks
can be protected by swapping larger substructures. In
our former work, we proposed a depth-dependent
crossover. The depth-dependent crossover protected
building blocks and constructed larger building blocks
easily by swapping shallower nodes. However, there was
problem-dependent characteristics on the
depth-dependent crossover, because the depth selection
probability was fixed for all nodes in a tree. To solve
this difficulty, we propose a self-tuning mechanism for
the depth selection probability. We call this type of
crossover a "self-tuning depth-dependent
crossover". We compare GP performances of the
selftuning depthdependent crossover with performances
of the original depth-dependent crossover. Our
experimental results clarify the superiority of the
self tuning depth dependent crossover.
%0 Book Section
%1 ito:1999:aigp3
%A Ito, Takuya
%A Iba, Hitoshi
%A Sato, Satoshi
%B Advances in Genetic Programming 3
%C Cambridge, MA, USA
%D 1999
%E Spector, Lee
%E Langdon, William B.
%E O'Reilly, Una-May
%E Angeline, Peter J.
%I MIT Press
%K algorithms, genetic programming
%P 377--399
%T A Self-Tuning Mechanism for Depth-Dependent
Crossover
%U http://www.cs.bham.ac.uk/~wbl/aigp3/ch16.pdf
%X There are three genetic operators: crossover, mutation
and reproduction in Genetic Programming (GP). Among
these genetic operators, the crossover operator mainly
contributes to searching for a solution program.
Therefore, we aim at improving the program generation
by extending the crossover operator. The normal
crossover selects crossover points randomly and
destroys building blocks. We think that building blocks
can be protected by swapping larger substructures. In
our former work, we proposed a depth-dependent
crossover. The depth-dependent crossover protected
building blocks and constructed larger building blocks
easily by swapping shallower nodes. However, there was
problem-dependent characteristics on the
depth-dependent crossover, because the depth selection
probability was fixed for all nodes in a tree. To solve
this difficulty, we propose a self-tuning mechanism for
the depth selection probability. We call this type of
crossover a "self-tuning depth-dependent
crossover". We compare GP performances of the
selftuning depthdependent crossover with performances
of the original depth-dependent crossover. Our
experimental results clarify the superiority of the
self tuning depth dependent crossover.
%& 16
%@ 0-262-19423-6
@incollection{ito:1999:aigp3,
abstract = {There are three genetic operators: crossover, mutation
and reproduction in Genetic Programming (GP). Among
these genetic operators, the crossover operator mainly
contributes to searching for a solution program.
Therefore, we aim at improving the program generation
by extending the crossover operator. The normal
crossover selects crossover points randomly and
destroys building blocks. We think that building blocks
can be protected by swapping larger substructures. In
our former work, we proposed a depth-dependent
crossover. The depth-dependent crossover protected
building blocks and constructed larger building blocks
easily by swapping shallower nodes. However, there was
problem-dependent characteristics on the
depth-dependent crossover, because the depth selection
probability was fixed for all nodes in a tree. To solve
this difficulty, we propose a self-tuning mechanism for
the depth selection probability. We call this type of
crossover a {"}self-tuning depth-dependent
crossover{"}. We compare GP performances of the
selftuning depthdependent crossover with performances
of the original depth-dependent crossover. Our
experimental results clarify the superiority of the
self tuning depth dependent crossover.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Cambridge, MA, USA},
author = {Ito, Takuya and Iba, Hitoshi and Sato, Satoshi},
biburl = {https://www.bibsonomy.org/bibtex/23708b8cc7f8cfff99d921377d9cf5788/brazovayeye},
booktitle = {Advances in Genetic Programming 3},
chapter = 16,
editor = {Spector, Lee and Langdon, William B. and O'Reilly, Una-May and Angeline, Peter J.},
interhash = {de3067481946639f5656609ee95e1f10},
intrahash = {3708b8cc7f8cfff99d921377d9cf5788},
isbn = {0-262-19423-6},
keywords = {algorithms, genetic programming},
month = {June},
notes = {AiGP3 11 mux, santa fe ant, 4-even parity, simulated
robot},
pages = {377--399},
publisher = {MIT Press},
timestamp = {2008-06-19T17:42:16.000+0200},
title = {A Self-Tuning Mechanism for Depth-Dependent
Crossover},
url = {http://www.cs.bham.ac.uk/~wbl/aigp3/ch16.pdf},
year = 1999
}