Dormant program nodes and the efficiency of genetic programming

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

  author =       "David Jackson",
  title =        "Dormant program nodes and the efficiency of genetic
  booktitle =    "{GECCO 2005}: Proceedings of the 2005 conference on
                 Genetic and evolutionary computation",
  year =         "2005",
  editor =       "Hans-Georg Beyer and Una-May O'Reilly and 
                 Dirk V. Arnold and Wolfgang Banzhaf and Christian Blum and 
                 Eric W. Bonabeau and Erick Cantu-Paz and 
                 Dipankar Dasgupta and Kalyanmoy Deb and James A. Foster and 
                 Edwin D. {de Jong} and Hod Lipson and Xavier Llora and 
                 Spiros Mancoridis and Martin Pelikan and Guenther R. Raidl and 
                 Terence Soule and Andy M. Tyrrell and 
                 Jean-Paul Watson and Eckart Zitzler",
  volume =       "2",
  ISBN =         "1-59593-010-8",
  pages =        "1745--1751",
  address =      "Washington DC, USA",
  URL =          "",
  DOI =          "doi:10.1145/1068009.1068299",
  publisher =    "ACM Press",
  publisher_address = "New York, NY, 10286-1405, USA",
  month =        "25-29 " # jun,
  organisation = "ACM SIGEVO (formerly ISGEC)",
  keywords =     "genetic algorithms, genetic programming, dormant node,
                 efficiency, experimentation, fitness preserving
                 crossover, intron, performance",
  size =         "7 pages",
  abstract =     "In genetic programming, there is a tendency for
                 individuals in a population to accumulate fragments of
                 code, often called introns, which are redundant in the
                 fitness evaluation of those individuals. Crossover at
                 the sites of certain classes of intron cannot produce a
                 different fitness in the offspring, but the cost of
                 identifying such sites may be high. We have therefore
                 focused our attention on one particular class of
                 non-contributory node that can be easily identified
                 without sophisticated analysis. Experimentation shows
                 that, for certain problem types, the presence of such
                 dormant nodes can be extensive. We have therefore
                 devised a technique that can use this information to
                 reduce the number of fitness evaluations performed,
                 leading to substantial savings in execution time
                 without affecting the results obtained.",
  notes =        "GECCO-2005 A joint meeting of the fourteenth
                 international conference on genetic algorithms
                 (ICGA-2005) and the tenth annual genetic programming
                 conference (GP-2005).

                 ACM Order Number 910052",

Genetic Programming entries for David Jackson