Genetic Transposition in Tree-Adjoining Grammar Guided
Genetic Programming: the Relocation Operator
X. Nguyen, R. McKay, D. Essam, and H. Abbass. 2004 Asia-Pacific Conference on Simulated Evolution
and Learning, Busan, Korea, (October 2004)
Abstract
We empirically investigate the use of relocation
operator as a local search operator, in combination
with genetic search, in a Tree Adjoining Grammar Guided
Genetic Programming system (TAG3P). The results show
that, on all the problems we tried, the use of the
relocation operator as a local search operator in TAG3P
outperforms TAG3P using purely crossover and mutation,
and also outperforms standard genetic programming (GP).
Moreover, it manages to solve problems with very small
population sizes.
%0 Conference Paper
%1 Nguyen:2004:APCSEL
%A Nguyen, Xuan Hoai
%A McKay, R. I. (Bob)
%A Essam, D. L.
%A Abbass, H. A.
%B 2004 Asia-Pacific Conference on Simulated Evolution
and Learning
%C Busan, Korea
%D 2004
%K algorithms, genetic programming
%T Genetic Transposition in Tree-Adjoining Grammar Guided
Genetic Programming: the Relocation Operator
%U http://sc.snu.ac.kr/PAPERS/SEAL2004.pdf
%X We empirically investigate the use of relocation
operator as a local search operator, in combination
with genetic search, in a Tree Adjoining Grammar Guided
Genetic Programming system (TAG3P). The results show
that, on all the problems we tried, the use of the
relocation operator as a local search operator in TAG3P
outperforms TAG3P using purely crossover and mutation,
and also outperforms standard genetic programming (GP).
Moreover, it manages to solve problems with very small
population sizes.
@inproceedings{Nguyen:2004:APCSEL,
abstract = {We empirically investigate the use of relocation
operator as a local search operator, in combination
with genetic search, in a Tree Adjoining Grammar Guided
Genetic Programming system (TAG3P). The results show
that, on all the problems we tried, the use of the
relocation operator as a local search operator in TAG3P
outperforms TAG3P using purely crossover and mutation,
and also outperforms standard genetic programming (GP).
Moreover, it manages to solve problems with very small
population sizes.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Busan, Korea},
author = {Nguyen, Xuan Hoai and McKay, R. I. (Bob) and Essam, D. L. and Abbass, H. A.},
biburl = {https://www.bibsonomy.org/bibtex/2d1e5b68561cd7d786be8f477f8a97a50/brazovayeye},
booktitle = {2004 Asia-Pacific Conference on Simulated Evolution
and Learning},
interhash = {2227fe5d5284b2990ed45b7ac5421762},
intrahash = {d1e5b68561cd7d786be8f477f8a97a50},
keywords = {algorithms, genetic programming},
month = {October},
notes = {Refereed International Conference Papers},
size = {6 pages},
timestamp = {2008-06-19T17:41:35.000+0200},
title = {Genetic Transposition in Tree-Adjoining Grammar Guided
Genetic Programming: the Relocation Operator},
url = {http://sc.snu.ac.kr/PAPERS/SEAL2004.pdf},
year = 2004
}