首页 | 本学科首页   官方微博 | 高级检索  
     


Evolving graph‐based chromosome by means of variable size genetic network programming with binomial distribution
Authors:Bing Li  Xianneng Li  Shingo Mabu  Kotaro Hirasawa
Abstract:Genetic network programming (GNP) is a graph‐based evolutionary algorithm with fixed size, which has been proven to solve complicated problems efficiently and effectively. In this paper, variable size genetic network programming (GNPvs) with binomial distribution has been proposed, which will change the size of the individuals and obtain their optimal size during evolution. The proposed method will select the number of nodes to move from one parent GNP to another parent GNP during crossover to implement the new feature of GNP. The probability of selecting the number of nodes to move satisfies a binomial distribution. The proposed method can keep the effectiveness of crossover, improve the performance of GNP, and find the optimal size of the individuals. The well‐known testbed Tileworld is used to show the numerical results in the simulations. © 2013 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.
Keywords:variable size  genetic network programming  crossover  binomial distribution  Tileworld
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号