Information landscapes

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1515-1522

  Borenstein, Yossi ^a   Palio, Riccardo ^b  

^a UNIVERSITY OF ESSEX   (United Kingdom)

^b NONE

Author keywords

Fitness landscape; Genetic Algorithm; Theory

Indexed keywords

FITNESS LANDSCAPE;

COMPUTATION THEORY; EMBEDDED SYSTEMS; GENETIC ALGORITHMS; MATHEMATICAL MODELS;

INFORMATION USE;

EID: 32444449633     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068248     Document Type: Conference Paper

References (22)

1. C. Blum and A.Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35(3): 268-308 2003.
2. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Morgan Kaufmann, 1989
3. S.Forrest and M.Mitchell. Relative Building Block Fitness and the Building Block Hypothesis. Foundations of Genetic Algorithms 2. Morgan Kaufmann, San Mateo, CA, 1992.
4. Y.Davidor. Epistasis variance: A viewpoint on GA-hardness. Foundations of Genetic Algorithms, Morgan Kaufmann, 1991.
5. B.Naudts..Measuring GA-hardness. Ph.d thesis. UV. Of Antwerp. Belgium, 1998.
6. B.Naudts and L. Kallel, Comparison of summary statistics of fitness landscapes,IEEE Trans. Evol. Comp. V.4.1:l-15, 2000
7. J.J.Grefenstette. Deception considered harmful. Foundations of Genetic Algorithms 2,Morgan Kaufmann: 75-91 1993
8. T. Jansen. On Classifications of Fitness Functions. Reihe CI 76/99, SFB 531, Universität Dortmund, 1999
9. H. Guo and W.H.Hsu. GA-hardness Revisited. GECCO 2003, Lecture Notes in Computer Science 2724, 1584-1585 Springer 2003.
10. Christian M. Reidys Peter F. Stadler. Combinatorial Landscapes. SIAM Review 44: 3-54 2002.
11. D. E. Goldberg. Making genetic algorithm fly: a lesson from the Wright brothers. Advanced Technology For Developers, 2 pp.1-8, February 1993.
12. S. Rana. Examining the Role of Local Optima and Schema Processing in Genetic Search. PhD thesis, Colorado State University, 1998.
13. L. Kallel, B. Naudts, and C. R. Reeves. Properties of fitness functions and search landscapes. In L. Kallel, B. Naudts, and A. Rogers, editors. Theoretical Aspects of Evolutionary Computing, 175-206. Springer, Berlin, 2001.
14. T.Jones and S.Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Larry Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 184-192, San Francisco, CA, 1995.
15. L.Altenberg. Fitness Distance Correlation analysis: An instructive counter-example. ICGA, pp 57-64, 1997.
16. S.A. Kauffman. The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, Oxford, 1993.
17. L.Altenberg. NK fitness landscapes. Handbook of Evolutionary Computation Section B2.7.2. 1997.
18. C.R.Reeves. Landscapes, operators and heuristic search. Annals of Operational Research, 86 473-490, 1999.
19. P.F.Stadler and C.R.Stephens. Landscapes and Effective Fitness. Comments Theori. Biol. 8: 389-431, 2002.
20. Y.Borenstein and R.Poli. Information Landscapes and Problem Hardness, In Proceedings of the Genetic and Evolutionary Computation Conference, ACM, 2005.
21. Y.Borenstein and R.Poli. Fitness distribution and GA hardness. PPSN VIII, Lecture Notes in Computer Science 3242 Springer 2004
22. Y.Borenstein and R.Poli. Information Landscapes and the Analysis of Search Algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference, ACM, 2005.