Some steps towards understanding how neutrality affects evolutionary search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4193 LNCS, Issue , 2006, Pages 778-787

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

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CORRELATION METHODS; PROBLEM SOLVING; TREES (MATHEMATICS);

EVOLUTIONARY PATH; EVOLUTIONARY SEARCH; NEUTRALITY;

COMPUTATIONAL COMPLEXITY;

EID: 33750258236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11844297_79     Document Type: Conference Paper

References (20)

1. L. Altenberg. Fitness distance correlation analysis: An instructive counterexample. In Proceedings of the Seventh International Conference on Genetic Algorithms, pages 57-64, San Francisco, CA, USA, 1997. Morgan Kaufmann Publishers Inc.
2. 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. Springer-Verlag, 9-14 Oct. 1994.
3. L. Barnett. Ruggedness and neutrality: The nkp family of fitness landscapes. In R. A. et al., editor, Artificial Live VI: Proceedings of the Sixth International Conference on Artificial Life, pages 18-27. MIT Press, 1998.
4. M. Clergue, P. Collard, M. Tomassini, and L. Vanneschi. Fitness distance correlation and problem difficulty for genetic programming. In W. B. L. et al., editor, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 724-732, New York, 9-13 July 2002. Morgan Kaufmann Publishers.
5. M. Collins. Finding needles in haystacks is harder with neutrality. In H.-G. B. et al., editor, 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.
6. D. E. Goldberg. Construction of high-order deceptive functions using low-order walsh coefficients. Ann. Math. Artif. Intell., 5(1):35-47, 1992.
7. 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: From Biology to Hardware (ICES), pages 406-422. Springer-Verlag, 1996.
8. C. Igel and M. Toussaint. Neutrality and self-adaptation. In Natural Computing, pages 117-132, 2003.
9. T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Proceedings of the 6th International Conference on GA, pages 184-192, San Francisco, CA, USA, 1995. Morgan Kaufmann Publishers Inc.
10. M. Kimura. Evolutionary rate at the molecular level. In Nature, volume 217, pages 624-626, 1968.
11. R. J. Quick, V. J. Rayward-Smith, and G. D. Smith. Fitness distance correlation and ridge functions. In PPSN V: Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, pages 77-86. Springer-Verlag, 1998.
12. R. Shipman, M. Schackleton, and I. Harvey. The use of neutral genotype-phenotype mappings for improved evolutionary search. BT. Technology Journal, 18(4):103111, October. ISSSN 2000.
13. R. Shipman, M. Schakleton, M. Ebner, and R. Watson. Neutral search spaces for artificial evolution: A lesson from life. In M. B. et al., editor, Artificial Life: Proceedings of the Seventh International Conference on Artificial Evolution, pages 162-169. MIT Press, 2000.
14. 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.
15. 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.
16. M. Tomassini, L. Vanneschi, P. Collard, and M. Clergue. A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation, 13(2):213-239, Summer 2005.
17. L. Vanneschi, M. Tomassini, P. Collard, and M. Clergue. Fitness distance correlation in structural mutation genetic programming. In C. R. et al., editor, Genetic Programming, Proceedings of EuroGP'2003, volume 2610 of LNCS, pages 455-464, Essex, 14-16 Apr. 2003. Springer-Verlag.
18. T. Yu and J. Miller. Neutrality and the evolvability of boolean function landscape. In Fourth European Conference on GP, pages 204-211. Springer-Verlag, 2001.
19. T. Yu and J. F. Miller. Needles in haystacks are not hard to find with neutrality. In J. A. F. et al., editor, 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.
20. 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.