Landscape characterization of numerical optimization problems using biased scattered data

2012 IEEE Congress on Evolutionary Computation, CEC 2012

Volumn , Issue , 2012, Pages

  Muñoz, Mario A ^a   Kirley, Michael ^a   Halgamuge, Saman K ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Data analysis; Heuristic algorithms; Information entropy; Optimization; Search problems

Indexed keywords

ALGORITHM SELECTION; COMPLETE CLASSIFICATION; COMPUTATIONAL SIMULATION; CONTINUOUS PARAMETERS; EMPIRICAL PERFORMANCE; FITNESS LANDSCAPE; INFORMATION ENTROPY; LANDSCAPE CHARACTERIZATION; METRIC VALUES; NUMERICAL OPTIMIZATIONS; ONLINE CALCULATIONS; OPTIMIZATION PROBLEMS; PROBLEM DIFFICULTY; PROBLEM SPACE; PROBLEM STRUCTURE; REPRESENTATION SCHEMES; SAMPLING METHOD; SCATTERED DATA; SEARCH ALGORITHMS; SEARCH PROBLEM; SEARCH PROCESS;

DATA REDUCTION; HEURISTIC ALGORITHMS;

OPTIMIZATION;

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

References (37)

1. T. Jansen, "On classifications of fitness functions," University of Dortmund, Tech. Rep. CI-76/99, November 1999.
2. C. Blum and X. Li, "Swarm intelligence in optimization," in Swarm Intelligence: Introduction and Applications, ser. Nat. Comput. Ser. Springer, 2008, pp. 43-85.
3. K. De Jong, "Parameter setting in EAs: a 30 year perspective," in Parameter Setting in Evolutionary Algorithms, ser. Stud. Comput. Intell., F. Lobo, C. Lima, and Z. Michalewicz, Eds. Springer, 2005, vol. 54, pp. 1-18.
4. D.Wolpert and W. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, April 1997.
5. B. Naudts and L. Kallel, "A comparison of predictive measures of problem difficulty in evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 4, no. 1, pp. 1-15, April 2000.
6. E. Weinberger, "Correlated and uncorrelated fitness landscapes and how to tell the difference," Biol. Cybern., vol. 63, pp. 325-336, 1990.
7. P. Stadler, "Landscapes and their correlation functions," J. Math. Chem., vol. 20, pp. 1-45, 1996.
8. B. Naudts, D. Suys, and A. Verschoren, "Epistasis as a basic concept in formal landscape analysis," in Proceedings of the 7th International Conference on Genetic Algorithms, T. Bäck, Ed. Morgan Kaufmann, July 1997, pp. 65-72.
9. S. Rochet, G. Venturini, M. Slimane, and E. El Kharoubi, "A critical and empirical study of epistasis measures for predicting ga performances: A summary," in Third European Conference on Artificial Evolution, 1998, pp. 275-285.
10. J. Garnier and L. Kallel, "How to detect all attraction basins of a function?" in Theoretical Aspects of Evolutionary Computation, ser. Nat. Comput. Ser. Springer, 2000, pp. 343-365.
11. V. Vassilev, T. Fogarty, and J. Miller, "Information characteristics and the structure of landscapes," Evol. Comput., vol. 8, no. 1, pp. 31-60, 2000.
12. A. Eremeev and C. Reeves, "Non-parametric estimation of properties of combinatorial landscapes," in Applications of Evolutionary Computing, ser. Lect. Notes Comput. Sc. Springer, 2002, vol. 2279, pp. 31-40.
13. J. Garnier and L. Kallel, "Efficiency of local search with multiple local optima," SIAM J. Discrete Math., vol. 15, no. 1, pp. 122-141, 2002.
14. A. Eremeev and C. Reeves, "On confidence intervals for the number of local optima," in Applications of Evolutionary Computing, ser. Lect. Notes Comput. Sc. Springer, 2003, vol. 2611, pp. 115-115.
15. P. Merz, "Advanced fitness landscape analysis and the performance of memetic algorithms," Evol. Comput., vol. 12, no. 3, pp. 303-325, 2004.
16. C. Reeves and A. Eremeev, "Statistical analysis of local search landscapes," J. Oper. Res. Soc., vol. 55, no. 7, pp. 687-693, 2004.
17. W. Hordijk and S. Kauffman, "Correlation analysis of coupled fitness landscapes," Complexity, vol. 10, no. 6, pp. 41-49, 2005.
18. B. Qu and B. Xu, "On epistasis for measure of genetic algorithm hardness," in Fuzzy Information Processing Society, 2006. NAFIPS 2006. Annual meeting of the North American, june 2006, pp. 73-76.
19. H. Richter, "Coupled map lattices as spatio-temporal fitness functions: Landscape measures and evolutionary optimization," Phys. Nonlinear Phenom., vol. 237, no. 2, pp. 167-186, 2008.
20. K. Steer, A. Wirth, and S. Halgamuge, "Information theoretic classification of problems for metaheuristics," in Proceedings of Simulated Evolution and Learning 2008, ser. Lect. Notes Comput. Sc., vol. 5361. Springer, 2008, pp. 319-328.
21. K. Malan and A. Engelbrecht, "Quantifying ruggedness of continuous landscapes using entropy," in Proceedings of the 2009 IEEE Congress on Evolutionary Computation (CEC2009), may 2009, pp. 1440-1447.
22. P. Caamaño, A. Prieto, J. Becerra, F. Bellas, and R. Duro, "Real-valued multimodal fitness landscape characterization for evolution," in Neural Information Processing. Theory and Algorithms, ser. Lect. Notes Comput. Sc., K. Wong, B. Mendis, and A. Bouzerdoum, Eds., vol. 6443. Springer, 2010, pp. 567-574.
23. J. He, C. Reeves, C. Witt, and X. Yao, "A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability," Evol. Comput., vol. 15, no. 4, pp. 435-443, 2007.
24. G. Merkuryeva and V. Bolshakovs, "Structural analysis of benchmarking fitness landscapes," Scientific Journal of Riga Technical University. Computer Sciences, vol. 42, pp. 81-86, 2010.
25. N. Hansen, "Variable metrics in evolutionary computation," Faculty Habilitation. Laboratoire de Recherche en Informatique - Université Paris-Sud, September 2009. [Online]. Available: http://www.lri.fr/~hansen/hansen-habil-manu.pdf
26. T. Jones, "Evolutionary algorithms, fitness landscapes and search," Ph.D. dissertation, University of New Mexico, 1995.
27. C. Reeves, "Fitness landscapes," in Search Methodologies, E. Burke and G. Kendall, Eds. Springer, 2005, pp. 587-610.
28. M. Houle, H.-P. Kriegel, P. Kröger, E. Schubert, and A. Zimek, "Can shared-neighbor distances defeat the curse of dimensionality?" in Scientific and Statistical Database Management, ser. Lect. Notes Comput. Sc., M. Gertz and B. Ludäscher, Eds., vol. 6187. Springer, 2010, pp. 482-500.
29. T. Weise, M. Zapf, R. Chiong, and A. Nebro, "Why is optimization difficult?" in Nature-Inspired Algorithms for Optimisation, ser. Stud. Comput. Intell., R. Chiong, Ed. Springer, 2009, vol. 193, pp. 1-50.
30. O. Mersmann, M. Preuss, and H. Trautmann, "Benchmarking evolutionary algorithms: Towards exploratory landscape analysis," in Proceedings of Parallel Problem Solving from Nature (PPSN XI), ser. Lect. Notes Comput. Sc., vol. 6238. Springer, 2010, pp. 73-82.
31. Y. Borenstein and R. Poli, "Information landscapes," in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2005). ACM, June 2005, pp. 1515-1522.
32. N. Hansen, A. Auger, S. Finck, and R. Ros, "Real-parameter black-box optimization benchmarking BBOB-2010: Experimental setup," INRIA, Tech. Rep. RR-7215, September 2010.
33. L. Devroye, Non-Uniform Random Variate Generation. Springer, 1986.
34. C. Igel, T. Suttorp, and N. Hansen, "A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies," in GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation. New York, NY, USA: ACM, 2006, pp. 453-460.
35. I. Trelea, "The particle swarm optimization algorithm: convergence analysis and parameter selection," Inform. Process Lett., vol. 85, no. 6, pp. 317-325, 2003.
36. R. Plackett, "Karl pearson and the chi-squared test," Int. Stat. Rev., vol. 51, no. 1, pp. 59-72, 1983.
37. S. Finck, N. Hansen, R. Ros, and A. Auger, "Real-parameter blackbox optimization benchmarking 2010: Presentation of the noiseless functions," University of Applied Science Vorarlberg and Université-Paris Sud, Tech. Rep., 2010.