Improved topological niching for real-valued global optimization

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

Abstract

We show how nearest-better clustering, the core component of the NBC-CMA niching evolutionary algorithm, is improved by appyling a second heuristic rule. This leads to enhanced basin identification for higher dimensional (5D to 20D) optimization problems, where the NBC-CMA has previously shown only mediocre performance compared to other niching and global optimization algorithms. The new method is integrated into a niching algorithm (NEA2) and compared to NBC-CMA and BIPOP-CMA-ES via the BBOB benchmarking suite. It performs very well on problems that enable recognizing basins at all with reasonable effort (number of basins not too high, e.g. the Gallagher problems), as expected. Beyond that point, niching is obviously not applicable any more and random restarts as done by the CMA-ES are the method of choice. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Preuss, M. (2012). Improved topological niching for real-valued global optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7248 LNCS, pp. 386–395). https://doi.org/10.1007/978-3-642-29178-4_39

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