Abstract
We empirically investigate the use of dual
duplication/truncation operators both as mutation
operators and as generic local search operators, in
combination with genetic search in a tree adjoining
grammar guided genetic programming system (TAG3P). The
results show that, on the problems tried,
duplication/truncation works well as a mutation
operator but not reliably when the complexity of the
problem was scaled up. When using these dual operators
as a generic local search operator, however, it helped
TAG3P not only to solve the problems reliably but also
cope well with scalability in problem complexity.
Moreover, it managed to solve problems with very small
population sizes.
Users
Please
log in to take part in the discussion (add own reviews or comments).