An empirical investigation of how and why neutrality affects evolutionary search

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 2, Issue , 2006, Pages 1149-1156

  Galván López, Edgar ^a   Poli, Riccardo ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Genetic Algorithms; Neutrality; Search Space

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; STATISTICAL MECHANICS;

EVOLUTIONARY PROCESS; NEUTRAL NETWORKS; NEUTRALITY; SEARCH SPACE;

EVOLUTIONARY ALGORITHMS;

EID: 33750261475     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144180     Document Type: Conference Paper

References (15)

1. W. Banzhaf. Genotype-phenotype-mapping and neutral variation - A case study in genetic programming. In Y. D. et al., editor, Parallel Problem Solving from Nature III, volume 866 of LNCS, pages 322-332, Jerusalem, 9-14 Oct. 1994. Springer-Verlag.
2. R. Chow. Evolving genotype to phenotype mappings with a multiple-chromosome genetic algorithm. In K. D. et al., editor, GECCO 2004: Proceedings of the 2004 Conference on Genetic and Evolutionary Computation, volume 1, pages 1006-1017, Seattle WA, USA, 26-30 June 2004. Springer-Verlag.
3. M. Collins. Finding needles in haystacks is harder with neutrality. In H.-G. Beyer, U.-M. O'Reilly, D. V. Arnold, W. Banzhaf, C. Blum, E. W. Bonabeau, E. Cantu-Paz, D. Dasgupta, K. Deb, J. A. Foster, E. D. de Jong, H. Lipson, X. Llora, S. Mancoridis, M. Pelikan, G. R. Raidl, T. Soule, A. M. Tyrrell, J.-P. Watson, and E. Zitzler, editors, GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, volume 2, pages 1613-1618, Washington DC, USA, 25-29 June 2005. ACM Press.
4. R. M. Downing. Evolving binary decision diagrams using implicit neutrality. In CEC 2005: IEEE Congress on Evolutionary Computation (CEC'2005), pages 5-11, Edinburgh, Scotland, 2005.
5. I. Harvey and A. Thompson. Through the labyrinth evolution finds a way: A silicon ridge. In Proceedings of the First International Conference on Evolvable Systems: Prom Biology to Hardware (ICES), pages 406-422. Springer-Verlag, 1996.
6. R. E. Keller and W. Banzhaf. Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes. In J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 116-122, Stanford University, CA, USA, 28-31 July 1996. MIT Press.
7. M. Kimura. Evolutionary rate at the molecular level. In Nature, volume 217, pages 624-626, 1968.
8. J. F. Miller and P. Thomson. Cartesian genetic programming. In R. Poli, W. Banzhaf, W. B. Langdon, J. F. Miller, P. Nordin, and T. C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP'2000, volume 1802 of LNCS, pages 121-132, Edinburgh, 15-16 Apr. 2000. Springer-Verlag.
9. R. Shipman, M. Schackleton, and I. Harvey. The use of neutral genotype-phenotype mappings for improved evolutionary search. BT. Technology Journal, 18(4):103-111, October. ISSSN 2000.
10. R. Shipman, M. Schakleton, M. Ebner, and R. Watson. Neutral search spaces for artificial evolution: A lesson from life. In M. Bedau, S. Rasmussen, J. McCaskill, and N. Packard, editors, Artificial Life: Proceedings of the Seventh International Conference on Artificial Evolution, pages 162-169. MIT Press, 2000.
11. T. Smith, P. Husbands, and M. O'Shea. Neutral networks and evolvability with complex genotype-phenotype mapping. Lecture Notes in Computer Science, 2159:272-282, 2001.
12. T. Smith, P. Husbands, and M. O'Shea. Neutral networks in an evolutionary robotics search space. In Congress on Evolutionary Computation: CEC 2001, pages 136-145. IEEE Press, 2001.
13. T. Yu and J. Miller. Neutrality and the evolvability of boolean function landscape. In Fourth European Conference on Genetic Programming, pages 204-211. Springer-Verlag, 2001.
14. T. Yu and J. F. Miller. Needles in haystacks are not hard to find with neutrality. In J. A. Foster, E. Lutton, J. Miller, C. Ryan, and A. G. B. Tettamanzi, editors, Genetic Programming, Proceedings of the 5th European Conference, EuroGP 2002, volume 2278 of LNCS, pages 13-25, Kinsale, Ireland, 3-5 Apr. 2002. Springer-Verlag.
15. T. Yu and J. F. Miller. The role of neutral and adaptive mutation in an evolutionary search on the onemax problem. In E. Cantú-Paz, editor, Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), pages 512-519, New York, NY, July 2002. AAAI.