Quantifying ruggedness of continuous landscapes using entropy

2009 IEEE Congress on Evolutionary Computation, CEC 2009

Volumn , Issue , 2009, Pages 1440-1447

  Malan, Katherine M ^a   Engelbrecht, Andries P ^a  

^a UNIVERSITY OF PRETORIA   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL INTELLIGENCE; CONTINUOUS DOMAIN; EVOLUTIONARY COMPUTATIONS; FITNESS LANDSCAPE; INFORMATION THEORETIC TECHNIQUES; MEASURES OF COMPLEXITY; NO FREE LUNCH THEOREM; OPTIMISATIONS; RELATIVE VALUE; TEST FUNCTIONS; UNSOLVED PROBLEMS; VISUAL INSPECTION;

CALCULATIONS; EVOLUTIONARY ALGORITHMS; INFORMATION THEORY; VISUAL COMMUNICATION;

PROBLEM SOLVING;

EID: 70450032953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2009.4983112     Document Type: Conference Paper

References (20)

1. D. H. Wolpert and W. G. Macready, "No Free Lunch Theorems for Optimization, " IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 67-82, April 1997. , .
2. Y. Borenstein and R. Poli, "Information landscapes, " in GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation. New York, NY, USA: ACM Press, 2005, pp. 1515- 1522.
3. "Information landscapes and problem hardness, " in GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation. New York, NY, USA: ACM Press, 2005, pp. 1425- 1431.
4. K. Deb and D. E. Goldberg, "Sufficient Conditions for Deceptive and Easy Binary Functions, " Annals of Mathematics and Artificial Intelligence, vol. 10, no. 4, pp. 385-408, December 1994.
5. D. E. Goldberg, J. Horn, and K. Deb, "What Makes a Problem Hard for a Classifier System?" Department of General Engineering, 117 Transportation Building, 104 South Mathews Avenue, Urbana, IL 61801-2996, Tech. Rep. IlliGAL Report No 92007, 1992. [Online]. Available: citeseer.ist.psu.edu/goldberg92what. html.
6. D. E. Goldberg, "Making Genetic Algorithms Fly: A Lesson from the Wright Brothers, " Advanced Technology for Developers, vol. 2, pp. 1-8, Feb. 1993.
7. J. J. Grefenstette, "Deception considered harmful, " in Foundations of Genetic Algorithms 2, D. L. Whitley, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 75-91.
8. S. Forrest and M. Mitchell, "What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation, " Machine Learning, vol. 13, pp. 285-319, 1993.
9. B. Naudts and L. Kallel, "A Comparison of Predictive Measures of Problem Difficulty in Evolutionary Algorithms, " IEEE Transactions on Evolutionary Computation, vol. 4, no. 1, p. 1, April 2000. [Online]. Available: citeseer.ist.psu.edu/naudts00comparison.html.
10. T. Jansen, "On Classifications of Fitness Functions, " Fachbereich Informatik, Universität Dortmund, 44221 Dortmund, Tech. Rep. CI-76/99, 1999. [Online]. Available: citeseer.ist.psu.edu/ jansen99classification.html.
11. J. He, C. Reeves, C. Witt, and X. Yao, "A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability, " Evolutionary Computation, vol. 15, no. 4, pp. 435-443, 2007.
12. E. Weinberger, "Correlated and Uncorrelated Fitness Landscapes and How to Tell the Difference, " Biological Cybernetics, vol. 63, no. 5, pp. 325-336, September 1990.
13. P. F. Stadler, "Landscapes and Their Correlation Functions, " J. Math. Chem., vol. 20, pp. 1-45, 1996.
14. J. Horn and D. E. Goldberg, "Genetic Algorithm Difficulty and the Modality of Fitness Landscapes, " in Foundations of Genetic Algorithms 3, L. D. Whitley and M. D. Vose, Eds. San Francisco, CA: Morgan Kaufmann, 1995, pp. 243-269. [Online]. Available: citeseer.ist.psu.edu/article/horn94genetic.html.
15. G. Rudolph, "How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time, " Evolutionary Computation, vol. 4, no. 2, pp. 195-203, April 1997.
16. S. Droste, T. Jansen, and I. Wegener, "Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization, " Theory of Computing Systems, vol. 39, no. 4, pp. 525-544, 2006.
17. V. K. Vassilev, T. C. Fogarty, and J. F. Miller, "Information Characteristics and the Structure of Landscapes, " Evolutionary Computation, vol. 8, no. 1, pp. 31-60, 2000.
18. V. K. Vassilev, "Fitness Landscapes and Search in the Evolutionary Design of Digital Circuits, " PhD Thesis, Napier University, 2000.
19. V. K. Vassilev, T. C. Fogarty, and J. F. Miller, "Smoothness, Ruggedness and Neutrality of Fitness Landscapes: from Theory to Application, " in Advances in Evolutionary Computing: Theory and applications. Springer-Verlag New York, Inc. 2003, pp. 3-44.
20. S. Roman, Coding and Information Theory. 175 Fifth Avenue, New York, USA: Springer-Verlag, 1992.