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

Bing Li*, Xianneng Li, Shingo Mabu, Kotaro Hirasawa

*この研究の対応する著者

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル2012 IEEE Congress on Evolutionary Computation, CEC 2012
DOI
出版ステータスPublished - 2012
イベント2012 IEEE Congress on Evolutionary Computation, CEC 2012 - Brisbane, QLD
継続期間: 2012 6 102012 6 15

Other

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

ASJC Scopus subject areas

  • 計算理論と計算数学
  • 理論的コンピュータサイエンス

フィンガープリント

「Towards automatic discovery and reuse of subroutines in variable size genetic network programming」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル