Towards Automatic Discovery and Reuse of Subroutines in Variable Size Genetic Network Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Li:2012:CECa,

• title = "Towards Automatic Discovery and Reuse of Subroutines in Variable Size Genetic Network Programming",
• author = "Bing Li and Xianneng Li and Shingo Mabu and Kotaro Hirasawa",
• pages = "485--492",
• booktitle = "Proceedings of the 2012 IEEE Congress on Evolutionary Computation",
• year = "2012",
• editor = "Xiaodong Li",
• month = "10-15 " # jun,
• DOI = "doi:10.1109/CEC.2012.6256512",
• size = "8 pages",
• address = "Brisbane, Australia",
• ISBN = "0-7803-8515-2",
• keywords = "genetic algorithms, genetic programming, Genetic Network Programming, Algorithms",
• 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.",
• notes = "WCCI 2012. CEC 2012 - A joint meeting of the IEEE, the EPS and the IET.",

}

Genetic Programming entries for Bing Li Xianneng Li Shingo Mabu Kotaro Hirasawa

Citations