- title = "The Role of Neutral and Adaptive Mutation in an Evolutionary Search on the OneMax Problem",
- author = "Tina Yu and Julian F. Miller",
- booktitle = "Late Breaking Papers at the Genetic and Evolutionary Computation Conference ({GECCO-2002})",
- editor = "Erick Cant{\'u}-Paz",
- year = "2002",
- month = jul,
- pages = "512--519",
- address = "New York, NY",
- publisher = "AAAI",
- publisher_address = "445 Burgess Drive, Menlo Park, CA 94025",
- keywords = "genetic algorithms, genetic programming, Cartesian genetic programming, neutrality",
-
URL = "
http://www.cs.mun.ca/~tinayu/Publications_files/GECCO2002Late.pdf",
-
URL = "
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.7418",
-
URL = "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.7418.pdf",
- broken = "http://www.cs.bham.ac.uk/~jfm/gecco2002Late.pdf",
- size = "9 pages",
- abstract = "We investigate neutrality in the simple Genetic Algorithms (SGA) and in our neutrality-enabled evolutionary system using the OneMax problem. The results show that with the support of limited neutrality, SGA is less effective than our system where a larger amount of neutrality is supported. In order to understand the role of neutrality in evolutionary search of this unimodal landscape, we have created a theoretical framework that gives the number of gene changes under different levels of neutrality. The interim results of this theoretical work are also presented",
-
notes = "Late Breaking Papers, {GECCO-2002}. A joint meeting of
the eleventh International Conference on Genetic
Algorithms ({ICGA-2002}) and the seventh Annual Genetic
Programming Conference ({GP-2002}) part of
cantu-paz:2002:GECCO:lbp
OneMax, explicit versus implicit neutrality, analysis. Variable mutation rate and neutrality. Success rate increases with neutrality (Hamming distance)",
