Variable size genetic network programming with binomial distribution

Bing Li, Xianneng Li, Shingo Mabu, Kotaro Hirasawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

This paper proposes a different type of Genetic Network Programming (GNP) Variable Size Genetic Network Programming (GNPvs) with Binomial Distribution. In contrast to the individuals with fixed size in Standard GNP, GNPvs will change the size of the individuals and obtain the optimal size of them during evolution. The proposed method defines a new type of crossover to implement the new feature of GNP. The new crossover will select the number of nodes to move from each parent GNP to another parent GNP. The probability of selecting the number of nodes to move satisfies the binomial probability distribution. The proposed method can keep the effectiveness of crossover and improve the performance of GNP. In order to verify the performance of the proposed method, a well-known benchmark problem Tile-world is used in the simulations. The simulation results show the effectiveness of the proposed method.

Original languageEnglish
Title of host publication2011 IEEE Congress of Evolutionary Computation, CEC 2011
Pages973-980
Number of pages8
DOIs
Publication statusPublished - 2011
Event2011 IEEE Congress of Evolutionary Computation, CEC 2011 - New Orleans, LA
Duration: 2011 Jun 52011 Jun 8

Other

Other2011 IEEE Congress of Evolutionary Computation, CEC 2011
CityNew Orleans, LA
Period11/6/511/6/8

Fingerprint

Network Programming
Genetic Network
Binomial distribution
Tile
Genetic Programming
Probability distributions
Crossover
Vertex of a graph
Simulation
Probability Distribution
Benchmark
Verify

Keywords

  • Binomial probability distribution
  • Crossover
  • Genetic Network Programming
  • Tile-world
  • Variable size

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Li, B., Li, X., Mabu, S., & Hirasawa, K. (2011). Variable size genetic network programming with binomial distribution. In 2011 IEEE Congress of Evolutionary Computation, CEC 2011 (pp. 973-980). [5949723] https://doi.org/10.1109/CEC.2011.5949723

Variable size genetic network programming with binomial distribution. / Li, Bing; Li, Xianneng; Mabu, Shingo; Hirasawa, Kotaro.

2011 IEEE Congress of Evolutionary Computation, CEC 2011. 2011. p. 973-980 5949723.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, B, Li, X, Mabu, S & Hirasawa, K 2011, Variable size genetic network programming with binomial distribution. in 2011 IEEE Congress of Evolutionary Computation, CEC 2011., 5949723, pp. 973-980, 2011 IEEE Congress of Evolutionary Computation, CEC 2011, New Orleans, LA, 11/6/5. https://doi.org/10.1109/CEC.2011.5949723
Li B, Li X, Mabu S, Hirasawa K. Variable size genetic network programming with binomial distribution. In 2011 IEEE Congress of Evolutionary Computation, CEC 2011. 2011. p. 973-980. 5949723 https://doi.org/10.1109/CEC.2011.5949723
Li, Bing ; Li, Xianneng ; Mabu, Shingo ; Hirasawa, Kotaro. / Variable size genetic network programming with binomial distribution. 2011 IEEE Congress of Evolutionary Computation, CEC 2011. 2011. pp. 973-980
@inproceedings{6c2533e560b943c2bc1c18d8d9d36d2e,
title = "Variable size genetic network programming with binomial distribution",
abstract = "This paper proposes a different type of Genetic Network Programming (GNP) Variable Size Genetic Network Programming (GNPvs) with Binomial Distribution. In contrast to the individuals with fixed size in Standard GNP, GNPvs will change the size of the individuals and obtain the optimal size of them during evolution. The proposed method defines a new type of crossover to implement the new feature of GNP. The new crossover will select the number of nodes to move from each parent GNP to another parent GNP. The probability of selecting the number of nodes to move satisfies the binomial probability distribution. The proposed method can keep the effectiveness of crossover and improve the performance of GNP. In order to verify the performance of the proposed method, a well-known benchmark problem Tile-world is used in the simulations. The simulation results show the effectiveness of the proposed method.",
keywords = "Binomial probability distribution, Crossover, Genetic Network Programming, Tile-world, Variable size",
author = "Bing Li and Xianneng Li and Shingo Mabu and Kotaro Hirasawa",
year = "2011",
doi = "10.1109/CEC.2011.5949723",
language = "English",
isbn = "9781424478347",
pages = "973--980",
booktitle = "2011 IEEE Congress of Evolutionary Computation, CEC 2011",

}

TY - GEN

T1 - Variable size genetic network programming with binomial distribution

AU - Li, Bing

AU - Li, Xianneng

AU - Mabu, Shingo

AU - Hirasawa, Kotaro

PY - 2011

Y1 - 2011

N2 - This paper proposes a different type of Genetic Network Programming (GNP) Variable Size Genetic Network Programming (GNPvs) with Binomial Distribution. In contrast to the individuals with fixed size in Standard GNP, GNPvs will change the size of the individuals and obtain the optimal size of them during evolution. The proposed method defines a new type of crossover to implement the new feature of GNP. The new crossover will select the number of nodes to move from each parent GNP to another parent GNP. The probability of selecting the number of nodes to move satisfies the binomial probability distribution. The proposed method can keep the effectiveness of crossover and improve the performance of GNP. In order to verify the performance of the proposed method, a well-known benchmark problem Tile-world is used in the simulations. The simulation results show the effectiveness of the proposed method.

AB - This paper proposes a different type of Genetic Network Programming (GNP) Variable Size Genetic Network Programming (GNPvs) with Binomial Distribution. In contrast to the individuals with fixed size in Standard GNP, GNPvs will change the size of the individuals and obtain the optimal size of them during evolution. The proposed method defines a new type of crossover to implement the new feature of GNP. The new crossover will select the number of nodes to move from each parent GNP to another parent GNP. The probability of selecting the number of nodes to move satisfies the binomial probability distribution. The proposed method can keep the effectiveness of crossover and improve the performance of GNP. In order to verify the performance of the proposed method, a well-known benchmark problem Tile-world is used in the simulations. The simulation results show the effectiveness of the proposed method.

KW - Binomial probability distribution

KW - Crossover

KW - Genetic Network Programming

KW - Tile-world

KW - Variable size

UR - http://www.scopus.com/inward/record.url?scp=80051997878&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051997878&partnerID=8YFLogxK

U2 - 10.1109/CEC.2011.5949723

DO - 10.1109/CEC.2011.5949723

M3 - Conference contribution

AN - SCOPUS:80051997878

SN - 9781424478347

SP - 973

EP - 980

BT - 2011 IEEE Congress of Evolutionary Computation, CEC 2011

ER -