Genetic network programming with reconstructed individuals

  • Authors:

  • Fengming Ye;Shigo Mabu;Lutao Wang;Shinji Eto;Kotaro Hirasawa

  • Affiliations:

  • Graduate School of Information Production and Systems, Waseda University, Kitakyushu, Fukuoka, Japan;Graduate School of Information Production and Systems, Waseda University, Kitakyushu, Fukuoka, Japan;Graduate School of Information Production and Systems, Waseda University, Kitakyushu, Fukuoka, Japan;Graduate School of Information Production and Systems, Waseda University, Kitakyushu, Fukuoka, Japan;Graduate School of Information Production and Systems, Waseda University, Kitakyushu, Fukuoka, Japan

  • Venue:
  • CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Genetic Network Programming (GNP) is a newly proposed evolutionary approach which can evolve itself and find the optimal solutions. It is a novel method based on the idea of Genetic Algorithm (GA) and uses the data structure of directed graphs. As GNP has been developed for dealing with problems in dynamic environments, many papers have demonstrated that GNP can be applied to many areas such as data mining, forecasting stock markets, elevator control systems, etc. Focusing on GNP's distinguished expression ability of the graph structure, this paper proposes a method named Genetic Network Programming with Reconstructed Individuals (GNP with RI). In the proposed method, the worst individuals are reconstructed and enhanced by the elite information before undergoing genetic operations (mutation and crossover). The enhancement of worst individuals mimics the maturing phenomenon in nature, where bad individuals can became smarter after receiving good education. GNP with RI has been applied to the tile-world which is an excellent benchmark for evaluating the proposed architecture. The performance of GNP with RI is compared with conventional GNP demonstrating its superiority.