Information landscapes and problem hardness

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1425-1431

  Borenstein, Yossi ^a   Poli, Riccardo ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Fitness landscape; Genetic Algorithm; Theory

Indexed keywords

FITNESS LANDSCAPE;

COMPUTATION THEORY; GENETIC ALGORITHMS; INFORMATION THEORY;

PROBLEM SOLVING;

EID: 32444449213     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068236     Document Type: Conference Paper

References (23)

1. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Morgan Kaufmann, 1989.
2. S.Forrest and M.Mitchell. Relative Building Block Fitness and the Building Block Hypothesis. In FOGA 2. Morgan Kaufmann, 1992.
3. D. E. Goldberg, Making genetic algorithm fly: a lesson from the Wright brothers. Advanced Technology For Developers, 2 pp.1-8, February 1993.
4. S. Rana. Examining the Role of Local Optima and Schema Processing in Genetic Search. PhD thesis, Colorado State University, 1998.
5. J.J.Grefenstette. Deception considered harmful. In Foundations of Genetic Algorithms 2, D. Whitley (Ed.), San Mateo, CA: Morgan Kaufmann, 1993.
6. T. Jansen. On Classifications of Fitness Functions. Reihe CI 76/99, SFB 531, Universität Dortmund, 1999.
7. Y.Davidor. Epistasis variance: A viewpoint on GA-hardness. In G.J.E Rawlines, editor FOGA-1,pp. 23-55. Morgan Kaufman 1991.
8. B.Naudts..Measuring GA-hardness. Ph.d thesis. UV. Of Antwerp. Belgium, 1998.
9. S.A. Kauffman. The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, Oxford, 1993.
10. L. Altenberg. NK fitness landscapes. Handbook of Evolutionary Computation 1997b.
11. B.Naudts and L.Kallel, Comparison of summery statistics of fitness landscapes, IEEE Trans.Evol.Comp. 2000.
12. H. Guo and W.H.Hsu. GA-hardness Revisited. GECCO 2003 Poster paper.
13. 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 CEC, 1995.
14. L.Altenberg. Fitness Distance Correlation analysis: An instructive counter-example. ICGA, pp 57-64, 1997.
15. F.Rothlauf. Representations for Genetic and Evolutionary Algorithms. Studies in Fuzziness and Soft Computing, Volume 104. Heidelberg: Springer, 1st edition 2002.
16. L.Altenberg. Evolving better representations through selective genome growth. Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1, 1994.
17. A.Moraglio and R.Poli. Topological interpretation of crossover. In Proceedings of GECCO, Springer, 2004.
18. N.J.Radcliffe. Equivalence class analysis of genetic algorithms. In Foundations of Genetic Algorithms 3. Morgan Kaufmann, 1994.
19. H. Huttel. On Rice's Theorem. Aalborg University. 2001.
20. Y.Borenstein and R.Poli. Information Landscapes. In Proceedings of the Genetic and Evolutionary Computation Conference, ACM, 2005.
21. Y.Borenstein and R.Poli. Information Landscapes and the Analysis of Search Algorithms. In Proceedings of GECCO, ACM, 2005.
22. M.Clergue, P.Collard. GA-hard functions built by combination of trap functions. In Proceedings CEC2002, IEEE Press. 2002.
23. C.R.Reeves. Landscapes, operators and heuristic search. Annals of Operational Research, 86 473-490, 199