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

Fingerprint

Network Programming
Genetic Network
Subroutines
Computer programming
Genetic Programming
Reuse
Graph Representation
Testbed
Subgraph
Verify
Module
Computer networks
Simulation

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

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

Towards automatic discovery and reuse of subroutines in variable size genetic network programming. / Li, Bing; Li, Xianneng; Mabu, Shingo; Hirasawa, Kotaro.

2012 IEEE Congress on Evolutionary Computation, CEC 2012. 2012. 6256512.

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

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, 2012 IEEE Congress on Evolutionary Computation, CEC 2012, Brisbane, QLD, 12/6/10. https://doi.org/10.1109/CEC.2012.6256512
Li B, Li X, Mabu S, Hirasawa K. Towards automatic discovery and reuse of subroutines in variable size genetic network programming. In 2012 IEEE Congress on Evolutionary Computation, CEC 2012. 2012. 6256512 https://doi.org/10.1109/CEC.2012.6256512
Li, Bing ; Li, Xianneng ; Mabu, Shingo ; Hirasawa, Kotaro. / Towards automatic discovery and reuse of subroutines in variable size genetic network programming. 2012 IEEE Congress on Evolutionary Computation, CEC 2012. 2012.
@inproceedings{94371df79ad94eb791eead352dd1a7ae,
title = "Towards automatic discovery and reuse of subroutines in variable size genetic network programming",
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.",
author = "Bing Li and Xianneng Li and Shingo Mabu and Kotaro Hirasawa",
year = "2012",
doi = "10.1109/CEC.2012.6256512",
language = "English",
isbn = "9781467315098",
booktitle = "2012 IEEE Congress on Evolutionary Computation, CEC 2012",

}

TY - GEN

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

AU - Li, Bing

AU - Li, Xianneng

AU - Mabu, Shingo

AU - Hirasawa, Kotaro

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84866883265&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866883265&partnerID=8YFLogxK

U2 - 10.1109/CEC.2012.6256512

DO - 10.1109/CEC.2012.6256512

M3 - Conference contribution

AN - SCOPUS:84866883265

SN - 9781467315098

BT - 2012 IEEE Congress on Evolutionary Computation, CEC 2012

ER -