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 language | English |
|---|---|
| Title of host publication | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 |
| Pages | 973-980 |
| Number of pages | 8 |
| DOIs | |
| Publication status | Published - 2011 |
| Event | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 - New Orleans, LA Duration: 2011 Jun 5 → 2011 Jun 8 |
Other
| Other | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 |
|---|---|
| City | New Orleans, LA |
| Period | 11/6/5 → 11/6/8 |
Keywords
- Binomial probability distribution
- Crossover
- Genetic Network Programming
- Tile-world
- Variable size
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Theoretical Computer Science