Abstract
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the 'best' one? and the second one: which algorithm should I use for my real world problem? Both are connected and neither is easy to answer. We present methods which can be used to analyse the raw data of a benchmark experiment and derive some insight regarding the answers to these questions. We employ the presented methods to analyse the BBOB'09 benchmark results and present some initial findings. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Mersmann, O., Preuss, M., & Trautmann, H. (2010). Benchmarking evolutionary algorithms: Towards exploratory landscape analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6238 LNCS, pp. 73–82). https://doi.org/10.1007/978-3-642-15844-5_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
