Efficiently Representing Populations in Genetic Programming   [GP]

by

Keijzer, M.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Advances in Genetic Programming 2, 1996, p. 259-278
Keywords:genetic algorithms, genetic programming
Abstract:
The chapter compares two representations for genetic programming. One [GP] is the commonly used Lisp S-Expression which uses the problem specific terminals and functions defined before a run as an alphabet. The other is a minimal Directed Acyclic Graph (DAG) that uses a variable alphabet of complete subtrees. This chapter will show that the DAG representation can replace S-Expression representation without any change in the functionality of a genetic programming system. [GP] In certain situations the amount of memory needed to represent a population can be reduced enormously when using a DAG. The implementation of Automatically Defined Functions (ADFs) [ADF] in a DAG gives rise to the definitions of a divergent ADF, and a compact ADF. The latter can represent huge programs in S-Expression format with a few elements.
Author(s) DL:Online papers for Keijzer, M.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InCollection{keijzer:1996:aigp2,
  author =       "Maarten Keijzer",
  title =        "Efficiently Representing Populations in Genetic
                 Programming",
  booktitle =    "Advances in Genetic Programming 2",
  publisher =    "MIT Press",
  year =         "1996",
  editor =       "Peter J. Angeline and K. E. {Kinnear, Jr.}",
  pages =        "259--278",
  chapter =      "13",
  address =      "Cambridge, MA, USA",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-262-01158-1",
  abstract =     "The chapter compares two representations for genetic
                 programming. One is the commonly used Lisp S-Expression
                 which uses the problem specific terminals and functions
                 defined before a run as an alphabet. The other is a
                 minimal Directed Acyclic Graph (DAG) that uses a
                 variable alphabet of complete subtrees. This chapter
                 will show that the DAG representation can replace
                 S-Expression representation without any change in the
                 functionality of a genetic programming system. In
                 certain situations the amount of memory needed to
                 represent a population can be reduced enormously when
                 using a DAG. The implementation of Automatically
                 Defined Functions (ADFs) in a DAG gives rise to the
                 definitions of a divergent ADF, and a compact ADF. The
                 latter can represent huge programs in S-Expression
                 format with a few elements.

                 ",
  size =         "21 pages",
}