Towards automatic discovery and reuse of subroutines in variable size genetic network programming

Bing Li, Xianneng Li, Shingo Mabu, Kotaro Hirasawa

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

1 Citation (Scopus)

Abstract

This paper presents an algorithm to discover and reuse subroutines in Variable Size Genetic Network Programming (GNPvs) called Subroutine embedded GNPvs (SGNPvs). GNPvs is a general type of GNP, which has a direct graph representation with changeable size. In order to improve the performance of GNPvs, SGNPvs has been proposed, in which a subroutine mechanism has been introduced to GNPvs by module acquisition. In SGNPvs, useful subgraphs are extracted and reused for individuals. Through extracting new subroutines to replace the old subroutines, SGNPvs can evolve the subroutines as well as evolve the individuals. The simulation results verify the performance of SGNPvs on a well-known dynamic multi-agent test bed - Tileworld.

Original languageEnglish
Title of host publication2012 IEEE Congress on Evolutionary Computation, CEC 2012
DOIs
Publication statusPublished - 2012
Event2012 IEEE Congress on Evolutionary Computation, CEC 2012 - Brisbane, QLD
Duration: 2012 Jun 102012 Jun 15

Other

Other2012 IEEE Congress on Evolutionary Computation, CEC 2012
CityBrisbane, QLD
Period12/6/1012/6/15

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Towards automatic discovery and reuse of subroutines in variable size genetic network programming'. Together they form a unique fingerprint.

  • Cite this

    Li, B., Li, X., Mabu, S., & Hirasawa, K. (2012). Towards automatic discovery and reuse of subroutines in variable size genetic network programming. In 2012 IEEE Congress on Evolutionary Computation, CEC 2012 [6256512] https://doi.org/10.1109/CEC.2012.6256512