On the utility of redundant encodings in mutation-based evolutionary search

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

Volumn 2439, Issue , 2002, Pages 88-98

  Knowles, Joshua D ^a   Watson, Richard A ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; REDUNDANCY; SIGNAL ENCODING;

CHANGING ENVIRONMENT; DIRECT ENCODING; ENCODING SCHEMES; EVOLUTIONARY SEARCH; HIGH MUTATION RATE; LARGE AMOUNTS; MUTATION RATES; RANDOM BOOLEAN NETWORKS;

ENCODING (SYMBOLS);

EID: 84944324628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45712-7_9     Document Type: Conference Paper

References (18)

1. L. Barnett. Netcrawling—optimal evolutionary search with neutral networks. In Proceedings of the 2001 Congress on Evolutionary Computation (CEC2001). IEEE Service Centre, Piscataway NJ, 2001.
2. S. Bornholdt and K. Sneppen. Robustness as an evolutionary principle. Proceedings of the Royal Society of London Series B-Biological Sciences, 267:2281–2286, 2000.
3. S. Bullock. Smooth operator? Understanding and visualising mutation bias. In J. Kelemen and P. Sosik, editors, Sixth European Conference on Artificial Life, pages 602–612, 2001.
4. M. Ebner, M. Shackleton, and R. Shipman. How neutral networks influence evolvability. Complexity, 2002. (In press).
5. I. Harvey and A. Thompson. Through the labyrinth evolution finds a way: A silicon ridge. In Proceedings of ICES96, pages 406–422. Springer-Verlag, 1996.
6. S. A. Kauffman. Adaptation on rugged fitness landscapes. In D. Stein, editor, Lectures in the Sciences of Complexity, pages 527–618. Redwood City: Addison- Wesley, 1989. SFI Studies in the Sciences of Complexity, Lecture Volume I.
7. M. Kimura. The Neutral Theory of Molecular Evolution. Cambridge University Press, 1983.
8. M. Motoki and R. Uehara. Unique solution instance generation for the 3- satisfiability (3-SAT) problem. Technical Report C-129, Dept. of Math and Comp. Sciences, Tokyo Institute of Technology, 1999.
9. M. A. Potter. An NK-landscape generator, 1997. Presented at the Workshop on Test Problem Generators for Evolutionary Algorithms, at the 7th ICGA.
10. C. M. Reidys and P. F. Stadler. Neutrality in fitness landscapes. Appl. Math. Comput., 117:321–350, 1998.
11. M. Shackleton, R. Shipman, and M. Ebner. An investigation of redundant genotype-phenotype mappings and their role in evolutionary search. In Proceedings of the 2000 Congress on Evolutionary Computation, pages 493–500, Piscataway, NJ, 2000. IEEE Service Center.
12. R. Shipman. Genetic redundancy: Desirable or problematic for evolutionary adaptation? In Proceedings of the 4th International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA). Springer-Verlag, 1999.
13. R. Shipman, M. Shackleton, M. Ebner, and R. Watson. Neutral search spaces for artificial evolution: a lesson from life. In Artificial Life VII: Proceedings of the Seventh International Conference. MIT Press, 2000.
14. E. van Nimwegen and J. P. Crutchfield. Metastable evolutionary dynamics: Crossing fitness barriers or escaping via neutral paths? Bulletin of Mathematical Biology, 62(5):799–848, Sep 2000.
15. V. K. Vassilev and J. F. Miller. The advantages of landscape neutrality in digital circuit evolution. In ICES, pages 252–263, 2000.
16. R. A. Watson. Analysis of recombinative algorithms on a non-separable buildingblock problem. In Foundations of Genetic Algorithms VI, pages 69–89. Morgan Kaufmann, 2001.
17. R. A. Watson, G. S. Hornby, and J. B. Pollack. Modeling building-block interdependency. In Parallel Problem Solving from Nature - PPSN V, pages 97–106. Springer-Verlag, 1998.
18. T. Yu and J. Miller. Neutrality and the evolvability of Boolean function landscape. In Proceedings of the 4th European Conference on Genetic Programming (EuroGP), volume LNCS 2038, page 204 ff. Springer-Verlag, 2001.