Elementary bit string mutation landscapes

FOGA'11 - Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI

Volumn , Issue , 2011, Pages 25-41

  Langdon, W B ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Elementary fitness autocorrelation; Fitness distance correlation; Genetic algorithms; Genetic programming; Graph theory; Hamming cube; Laplacian; Optimisation; Search; Walsh transform

Indexed keywords

ELEMENTARY FITNESS AUTOCORRELATION; FITNESS DISTANCE CORRELATION; HAMMING CUBE; LAPLACIANS; OPTIMISATIONS; SEARCH;

AUTOCORRELATION; EIGENVALUES AND EIGENFUNCTIONS; GENETIC PROGRAMMING; GRAPH THEORY; HEALTH; LAPLACE TRANSFORMS; WALSH TRANSFORMS;

GENETIC ALGORITHMS;

EID: 79956004485     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967654.1967658     Document Type: Conference Paper

References (29)

1. T. Bäck. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, New York, 1996.
2. T. Biyikoglu, J. Leydold, and P. F. Stadler. Laplacian Eigenvectors of Graphs: Perron-Frobenius and Faber-Krahn Type Theorems, volume 1915 of Lecture Notes in Mathematics. Springer, 2007.
3. S. Dignum and R. Poli. Generalisation of the limiting distribution of program sizes in tree-based genetic programming and analysis of its effects on bloat. In D. Thierens, H.-G. Beyer, J. Bongard, J. Branke, J. A. Clark, D. Cliff, C. B. Congdon, K. Deb, B. Doerr, T. Kovacs, S. Kumar, J. F. Miller, J. Moore, F. Neumann, M. Pelikan, R. Poli, K. Sastry, K. O. Stanley, T. Stutzle, R. A. Watson, and I. Wegener, editors, GECCO'07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, volume 2, pages 1588-1595, London, 7-11 July 2007. ACM Press. (Pubitemid 47291766)
4. B. Dimova, J. W. Barnes, and E. Popova. Arbitrary elementary landscapes & AR(1) processes. Applied Mathematics Letters, 18(3):287-292, 2005. (Pubitemid 40245106)
5. B. Dimova, J. W. Barnes, E. Popova, and B. W. Colletti. Some additional properties of elementary landscapes. Applied Mathematics Letters, 22(2):232-235, Feb 2009.
6. L. K. Grover. Local search and the local structure of NP-complete problems. Operations Research Letters, 12(4):235-243, 1992.
7. Terry Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Proceedings of the 6th International Conference on Genetic Algorithms, ICGA 1995, pages 184-192. Morgan Kaufmann, 1995.
8. J. R. Koza. Genetic Programming: On the Programming of Computers by Natural Selection. MIT press, 1992.
9. W. B. Langdon. The evolution of size in variable length representations. In 1998 IEEE International Conference on Evolutionary Computation, pages 633-638, Anchorage, Alaska, USA, 5-9 May 1998. IEEE Press.
10. W. B. Langdon. Scaling of program tree fitness spaces. Evolutionary Computation, 7(4):399-428, Winter 1999.
11. W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.
12. R. Poli, W. B. Langdon, and O. Holland. Extending particle swarm optimisation via genetic programming. In M. Keijzer, A. Tettamanzi, P. Collet, J. I. van Hemert, and M. Tomassini, editors, Proceedings of the 8th European Conference on Genetic Programming, volume 3447 of Lecture Notes in Computer Science, pages 291-300, Lausanne, Switzerland, 30 Mar. - 1 Apr. 2005. Springer. (Pubitemid 41274034)
13. R. Poli, W. B. Langdon, and N. F. McPhee. A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk, 2008. (With contributions by J. R. Koza).
14. C. R. Reeves. Fitness landscapes. In E. K. Burke and G. Kendall, editors, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, chapter 19, pages 587-610. Springer, 2005.
15. C. R. Reeves and J. E. Rowe. Genetic Algorithms-Principles and Perspectives: A Guide to GA Theory. Kluwer Academic Publishers, 2003.
16. F. Rothlauf. Representations for Genetic and Evolutionary Algorithms. Physica-Verlag, 2002.
17. P. F. Stadler, R. Seitz, and G. P. Wagner. Population dependent Fourier decomposition of fitness landscapes over recombination spaces: Evolvability of complex characters. Bulletin of Mathematical Biology, 62:399-428, 2000.
18. P. F. Stadler. Landscapes and their correlation functions. Technical Report 95-07-067, Santa Fe Institute, USA, 1995.
19. P. F. Stadler and G. P. Wagner. Algebraic theory of recombination spaces. Evolutionary Computation, 5(3):241-275, 1997. (Pubitemid 127718105)
20. A. M. Sutton, A. E. Howe, and L. D. Whitley. Estimating Bounds on Expected Plateau Size in MAXSAT Problems. In T. Sẗutzle, M. Birattari, and H. H. Hoos, editors, Second International Workshop, Engineering Stochastic Local Search Algorithms. SLS 2009, volume 5752 of Lecture Notes in Computer Science, pages 31-45, Brussels, 3-4 September 2009. Springer.
21. A. M. Sutton, A. E. Howe, and L. D. Whitley. A theoretical analysis of the k-satisfiability search space. In T. Sẗutzle, M. Birattari, and H. H. Hoos, editors, Second International Workshop, Engineering Stochastic Local Search Algorithms. SLS 2009, volume 5752 of Lecture Notes in Computer Science, pages 46-60, Brussels, 3-4 September 2009. Springer.
22. A. M. Sutton, L. D. Whitley, and A. E. Howe. A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. In GECCO'09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 365-372, Montreal, 2009. ACM.
23. V. K. Vassilev, T. C. Fogarty, and J. F. Miller. Information characteristics and the structure of landscapes. Evolutionary Computation, 8(1):31-60, Spring 2000.
24. V. K. Vassilev, T. C. Fogarty, and J. F. Miller. Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application. In A. Ghosh and S. Tsutsui, editors, Advances in evolutionary computing: theory and applications, pages 3-44. Springer-Verlag New York, Inc., 2003.
25. D. Whitley, D. Hains, and A. Howe. Tunneling between optima: partition crossover for the traveling salesman problem. In GECCO'09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 915-922, Montreal, 2009. ACM.
26. D. Whitley, A. M. Sutton, and A. E. Howe. Understanding elementary landscapes. In M. Keijzer, G. Antoniol, C. B. Congdon, K. Deb, B. Doerr, N. Hansen, J. H. Holmes, G. S. Hornby, D. Howard, J. Kennedy, S. Kumar, F. G. Lobo, J. F. Miller, J. Moore, F. Neumann, M. Pelikan, J. Pollack, K. Sastry, K. Stanley, A. Stoica, E.-G. Talbi, and I. Wegener, editors, GECCO'08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 585-592, Atlanta, GA, USA, 12-16 July 2008. ACM.
27. L. D. Whitley and A. M. Sutton. Elementary landscape analysis. In GECCO'09: Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference, pages 3227-3236, Montreal, 8-12 July 2009. ACM. Tutorial.
28. L. D. Whitley and A. M. Sutton. Partial neighborhoods of elementary landscapes. In G. Raidl, F. Rothlauf, G. Squillero, R. Drechsler, T. Stuetzle, M. Birattari, C. B. Congdon, M. Middendorf, C. Blum, C. Cotta, P. Bosman, J. Grahl, J. Knowles, D. Corne, H.-G. Beyer, K. Stanley, J. F. Miller, J. van Hemert, T. Lenaerts, M. Ebner, J. Bacardit, M. O'Neill, M. Di Penta, B. Doerr, T. Jansen, R. Poli, and E. Alba, editors, GECCO'09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 381-388, Montreal, 8-12 July 2009. ACM.
29. Tina Yu and J. F. Miller. Through the interaction of neutral and adaptive mutations, evolutionary search finds a way. Artificial Life, 12(4):525-551, Fall 2006. (Pubitemid 44356023)