Variable Size Genetic Network Programming with Binomial Distribution

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Li:2011:VSGNPwBD,

• title = "Variable Size Genetic Network Programming with Binomial Distribution",
• author = "Bing Li and Xianneng Li and Shingo Mabu and Kotaro Hirasawa",
• pages = "973--980",
• booktitle = "Proceedings of the 2011 IEEE Congress on Evolutionary Computation",
• year = "2011",
• editor = "Alice E. Smith",
• month = "5-8 " # jun,
• address = "New Orleans, USA",
• organization = "IEEE Computational Intelligence Society",
• publisher = "IEEE Press",
• ISBN = "0-7803-8515-2",
• keywords = "genetic algorithms, genetic programming, genetic network programming, Algorithms:",
• DOI = "doi:10.1109/CEC.2011.5949723",
• 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.",
• notes = "CEC2011 sponsored by the IEEE Computational Intelligence Society, and previously sponsored by the EPS and the IET.",

}

Genetic Programming entries for Bing Li Xianneng Li Shingo Mabu Kotaro Hirasawa

Citations