Experiments with tuneable fitness landscapes

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

Volumn 1917, Issue , 2000, Pages 139-148

  Reeves, Colin R ^a  

^a Institute for Clean Growth and Future Mobility   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS;

FITNESS LANDSCAPE; GLOBAL OPTIMUM; HEURISTIC SEARCH ALGORITHMS; LOCAL OPTIMA; NK-LANDSCAPES; SEARCH PROBLEM;

OPTIMIZATION;

EID: 84947929528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_14     Document Type: Conference Paper

References (20)

1. Y. Dnvidor. (1990) Epistasis variance: suitability of a representation to genetic algorithms. Complex Systems, 4, 369-383.
2. Y. Davidor. (1991) Epistasis variance: a viewpoint on GA-hardness. In G.J.E.Rawlins (Ed.) (1991) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA.
3. C. R. Reeves, and C. C. Wright. (1995) An experimental design perspective on genetic algorithms. In D.Whitley and M.Vose (Eds.) (1995) Foundations of Genetic Algorithms 3, Morgan Kaufmann, San Mateo, CA.
4. C. R. Rceves, and C. C. Wright. (1995) Epistasis in genetic algorithms: an experimental design perspective. In L. J.Eshelman (Ed.) (1995) Proceedings of the 6th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA.
5. A. Aizawa. (1997) Fitness landscape characterization by variance of decompositions. In R.K.Helcw and M.D.Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kaufmann, San Francisco, CA, 225-245.
6. R. Heckendorn, S. Rana, and D. Whitley. (1997) Nonlinearity, hyperplane ranking and the simple genetic algorithm. In R.K.Belew and M.D.Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kaufmann, San Francisco, CA, 181-202.
7. J. C. Culberson (1995) Mutation-crossover isomorphisms and the construction of discriminating functions. Evolutionary Computation, 2, 279-311.
8. T. Clones (1995) Evolutionary Algorithms, Fitness Landscapes and Search, Doctoral dissertation, University of New Mexico, Albuquerque, NM.
9. T. Soule and J. A. Foster (1997) Genetic algorithm hardness measures applied to the maximum clique problem. In Th.flack (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 81-88.
10. K. A. Dclong, M. A. Potter and W. M. Spears (1997) Using problem generators to explore the effects of epistasis. In Th.Back (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 338-345.
11. L. Kallel, and M. Sclioenauer (1997) Alternative random initialization in genetic algorithms. In Th.Back (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 268-275.
12. C. R. Beeves (1999) Predictive measures for problem difficulty. In Proceedings of 1999 Congress on Evolutionary Computation, IEEE Press, Piscataway, NJ, 736-743.
13. C. R. Reeves. (1999) Fitness landscapes and evolutionary algorithms. To appear in C.R.Fonlupt el at. (2000) Proceedings of Evolution Artificielle 99, Springer-Verlag.
14. S.Kauffnian (1993) The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press.
15. T. Jones, and S. Fortest. (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In L.J.Eshelman (Ed.) Proceedings of the 6th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 184-192.
16. B. Manderick, M. de Weger, and P. Spiessens (1991) The genetic algorithm and the structure of the fit ness landscape. In R.K.Bclew and I,.B.Booker (Eds.) (1991) Proceedings of 4"1 International Conference on Genetic Algorithms, Morgan Kaufmann, Sail Mateo, CA, 143-150.
17. R. B. IIeckendorn, and D. Whitley (1997) A Walsh analysis of NA'-landscapes. In Th.Back (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 41-48.
18. P. F. Stadler, and G. P. Wagner (1998) Algebraic theory of recombination spaces. Evolutionary Computation, 5, 241-275.
19. F. Yates (1937) Design ami Analysis of Factorial Experiments, Tech.Comm. No.35, Imperial Bureau of Soil Sciences, London.
20. D. C. Montgomery, (1991) Design and Analysis of Experiments. Wiley, New York.