Variable Size Genetic Network Programming

Katagiri Hironobu, Hu Jinglu, Murata Junichi, Hirasawa Kotaro

Research output: Contribution to journalArticle

10 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)57-66
Number of pages10
JournalIEEJ Transactions on Electronics, Information and Systems
Volume123
Issue number1
DOIs
Publication statusPublished - 2003 Jan

    Fingerprint

Keywords

  • Evolutionary Computation
  • Genetic Network Programming
  • Genetic Programming
  • arbitrary directed graph
  • planning
  • the tileworld

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this