Graph Structured Program Evolution: Evolution of Loop Structures

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

  author =       "Shinichi Shirakawa and Tomoharu Nagao",
  title =        "Graph Structured Program Evolution: Evolution of Loop
  booktitle =    "Genetic Programming Theory and Practice {VII}",
  year =         "2009",
  editor =       "Rick L. Riolo and Una-May O'Reilly and 
                 Trent McConaghy",
  series =       "Genetic and Evolutionary Computation",
  address =      "Ann Arbor",
  month =        "14-16 " # may,
  publisher =    "Springer",
  chapter =      "11",
  pages =        "177--194",
  keywords =     "genetic algorithms, genetic programming, automatic
                 programming, graph-based genetic programming, genetic
                 algorithm, factorial, exponentiation, list sorting",
  isbn13 =       "978-1-4419-1653-2",
  DOI =          "doi:10.1007/978-1-4419-1626-6_11",
  abstract =     "Recently, numerous automatic programming techniques
                 have been developed and applied in various fields. A
                 typical example is genetic programming (GP), and
                 various extensions and representations of GP have been
                 proposed thus far. Complex programs and hand-written
                 programs, however, may contain several loops and handle
                 multiple data types. In this chapter, we propose a new
                 method called Graph Structured Program Evolution
                 (GRAPE). The representation of GRAPE is a graph
                 structure; therefore, it can represent branches and
                 loops using this structure. Each program is constructed
                 as an arbitrary directed graph of nodes and a data set.
                 The GRAPE program handles multiple data types using the
                 data set for each type, and the genotype of GRAPE takes
                 the form of a linear string of integers. We apply GRAPE
                 to three test problems, factorial, exponentiation, and
                 list sorting, and demonstrate that the optimum solution
                 in each problem is obtained by the GRAPE system",
  notes =        "part of \cite{Riolo:2009:GPTP}",

Genetic Programming entries for Shinichi Shirakawa Tomoharu Nagao