Variable Size Genetic Network Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8098
- @Article{Katagiri:2003:IEEJteis,
-
author = "Hironobu Katagiri and Kotaro Hirasawa and
Jinglu Hu and Junichi Murata",
-
title = "Variable Size Genetic Network Programming",
-
journal = "IEEJ Transactions on Electronics, Information and
Systems",
-
year = "2003",
-
volume = "123",
-
number = "1",
-
pages = "57--66",
-
keywords = "genetic algorithms, genetic programming, Genetic
Programming, Genetic Network Programming, Evolutionary
Computation, arbitrary directed graph, planning, the
tileworld",
-
publisher = "Institute of Electrical Engineers of Japan",
-
ISSN = "0385-4221",
-
URL = "https://www.jstage.jst.go.jp/article/ieejeiss/123/1/123_1_57/_pdf",
-
DOI = "doi:10.1541/ieejeiss.123.57",
-
size = "10 pages",
-
abstract = "Genetic Network Programming (GNP) is a kind of
evolutionary methods, which evolves arbitrary directed
graph programs. Previously, the program size of GNP was
fixed. In the paper, a new method is proposed, where
the program size is adaptively changed depending on the
frequency of the use of nodes. To control and to decide
a program size are important and difficult problems in
Evolutionary Computation, especially, a well-known
crossover operator tends to cause bloat. We introduce
two additional operators, add operator and delete
operator, that can change the number of each kind of
nodes based on whether a node function is important in
the environment or not. Simulation results shows that
the proposed method brings about extremely better
results compared with ordinary fixed size GNP.",
-
notes = "In Japanese. Special Issue Paper",
- }
Genetic Programming entries for
Hironobu Katagiri
Kotaro Hirasawa
Jinglu Hu
Junichi Murata
Citations