Neutral offspring controlling operators in genetic programming

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

@Article{Zhang:2006:PR,
  author =       "Liang Zhang and Asoke K. Nandi",
  title =        "Neutral offspring controlling operators in genetic
                 programming",
  journal =      "Pattern Recognition",
  year =         "2007",
  volume =       "40",
  number =       "10",
  pages =        "2696--2705",
  month =        oct,
  keywords =     "genetic algorithms, genetic programming, Neutral
                 offspring, Code bloat, Parsimony pressure",
  DOI =          "doi:10.1016/j.patcog.2006.10.001",
  abstract =     "Code bloat, one of the main issues of genetic
                 programming (GP), slows down the search process,
                 destroys program structures, and exhausts computer
                 resources. To deal with these issues, two kinds of
                 neutral offspring controlling operators are proposed
                 non-neutral offspring (NNO) operators and non-larger
                 neutral offspring (NLNO) operators. Two GP benchmark
                 problems symbolic regression and 11-multiplexer are
                 used to test the new operators. Experimental results
                 indicate that NLNO is able to confine code bloat
                 significantly and improve performance simultaneously,
                 which NNO cannot do.",
}

Genetic Programming entries for Liang Zhang Asoke K Nandi

Citations