Adaptive genetic network programming

Xianneng Li*, Wen He, Kotaro Hirasawa

*Corresponding author for this work

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

4 Citations (Scopus)


Genetic Network Programming (GNP) is derived from Genetic Algorithm (GA) and Genetic Programming (GP), which applies evolution theory to evolve a population of directed graph to model complex systems. It has been shown that GNP can solve typical control problems, as well as many real-world problems. However, studying GNP is mainly focused on the specific aspect, while the fundamental characteristics that ensure the success of GNP are rarely investigated in the previous research. This paper reveals an important feature of GNP - reusability of nodes - to efficiently identify and formulate the building blocks of evolution. Accordingly, adaptive GNP is developed which self-adapts both crossover and mutation probabilities of each search variable to circumstances. The adaptation allows the automatic adjustment of evolution bias toward the frequently reused nodes in high-quality individuals. The adaptive GNP is compared with traditional GNP in a benchmark control testbed to evaluate its superiority.

Original languageEnglish
Title of host publicationProceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages8
ISBN (Print)9781479914883
Publication statusPublished - 2014 Sept 16
Event2014 IEEE Congress on Evolutionary Computation, CEC 2014 - Beijing
Duration: 2014 Jul 62014 Jul 11


Other2014 IEEE Congress on Evolutionary Computation, CEC 2014

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Theoretical Computer Science


Dive into the research topics of 'Adaptive genetic network programming'. Together they form a unique fingerprint.

Cite this