Genotype-Phenotype-Mapping and Neutral Variation -- A case study in Genetic Programming   [GP]

by

Banzhaf, W.

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: Parallel Problem Solving from Nature III (Conference proceedings), 1994, p. 322-332
Keywords:genetic algorithms, genetic programming
Abstract:
We propose the application of a genotype-phenotype mapping to [GM] the solution of constrained optimization problems. [CO] The method consists of strictly separating the search space [SS] of genotypes from the solution space of phenotypes. A mapping from genotypes into phenotypes provides for the appropriate expression of information represented by the genotypes. The mapping is constructed as to guarantee feasibility of phenotypic solutions for the problem under study. This enforcing of constraints causes multiple genotypes to result in one and the same phenotype. Neutral variants are therefore frequent and play an important role in maintaining genetic diversity. [GD] As a specific example, we discuss Binary Genetic Programming [GP] (BGP), a variant of Genetic Programming [GP] that uses binary strings as genotypes and program trees [PT] as phenotypes.
Notes:
PPSN3 Tested on symbolic regression of 0.5x**2 and exp(-3.0*x**2) Produces high level code (FORTRAN, C?) which is compiled, claims this gives huge speedup.
URL(s):(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{banzhaf:1994:ppsn3,
  author =       "Wolfgang Banzhaf",
  title =        "Genotype-Phenotype-Mapping and Neutral Variation --
                 {A} case study in Genetic Programming",
  booktitle =    "Parallel Problem Solving from Nature III",
  year =         "1994",
  editor =       "Yuval Davidor and Hans-Paul Schwefel and Reinhard
                 M{\"a}nner",
  pages =        "322--332",
  address =      "Jerusalem",
  publisher_address = "Berlin, Germany",
  month =        "9-14 " # oct,
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "ftp://lumpi.informatik.uni-dortmund.de/pub/biocomp/ppsn94.ps.gz",
  abstract =     "We propose the application of a genotype-phenotype
                 mapping to the solution of constrained optimization
                 problems. The method consists of strictly separating
                 the search space of genotypes from the solution space
                 of phenotypes. A mapping from genotypes into phenotypes
                 provides for the appropriate expression of information
                 represented by the genotypes. The mapping is
                 constructed as to guarantee feasibility of phenotypic
                 solutions for the problem under study. This enforcing
                 of constraints causes multiple genotypes to result in
                 one and the same phenotype. Neutral variants are
                 therefore frequent and play an important role in
                 maintaining genetic diversity. As a specific example,
                 we discuss Binary Genetic Programming (BGP), a variant
                 of Genetic Programming that uses binary strings as
                 genotypes and program trees as phenotypes.",
  notes =        "PPSN3

                 Tested on symbolic regression of 0.5x**2 and
                 exp(-3.0*x**2) Produces high level code (FORTRAN, C?)
                 which is compiled, claims this gives huge speedup.

                 ",
}