An analysis of the genetic marker diversity algorithm for genetic programming

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

@Article{Burks:2016:GPEM,
  author =       "Armand R. Burks and William F. Punch",
  title =        "An analysis of the genetic marker diversity algorithm
                 for genetic programming",
  journal =      "Genetic Programming and Evolvable Machines",
  year =         "2017",
  volume =       "18",
  number =       "2",
  pages =        "213--245",
  month =        jun,
  keywords =     "genetic algorithms, genetic programming, Genotypic
                 diversity, Structural diversity, Premature
                 convergence",
  ISSN =         "1389-2576",
  DOI =          "doi:10.1007/s10710-016-9281-9",
  size =         "33 pages",
  abstract =     "Many diversity techniques have been developed for
                 addressing premature convergence, which is a serious
                 problem that stifles the search effectiveness of
                 evolutionary algorithms. However, approaches that aim
                 to avoid premature convergence can often take longer to
                 discover a solution. The Genetic Marker Diversity
                 algorithm is a new technique that has been shown to
                 find solutions significantly faster than other
                 approaches while maintaining diversity in genetic
                 programming. This study provides a more in-depth
                 analysis of the search behaviour of this technique
                 compared to other state-of-the-art methods, as well as
                 a comparison of the performance of these techniques on
                 a larger and more modern set of test problems.",
}

Genetic Programming entries for Armand R Burks William F Punch

Citations