Comparing the niches of CMA-ES, CHC and pattern search using diverse benchmarks

13Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper explores two questions: 1) On a relatively difficult and varied set of test problems, can we observe differences in evolutionary search algorithm performance related to problem features? 2) How do the evolutionary algorithms compare to Pattern Search algorithms, a more traditional optimization tool popular in the larger scientific community? The results suggest there are consistent differences in algorithm performance that can be related back to problem features. Some new ideas for the construction of benchmark problems are also introduced. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Whitley, D., Lunacek, M., & Sokolov, A. (2006). Comparing the niches of CMA-ES, CHC and pattern search using diverse benchmarks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 988–997). Springer Verlag. https://doi.org/10.1007/11844297_100

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free