Improved Topological Niching for Real-Valued Global Optimization

  • Mike Preuss
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7248)


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.


Latin Hypercube Sampling Heuristic Rule Incoming Connection Multimodal Problem Multimodal Optimization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Auger, A., Hansen, N.: A restart CMA evolution strategy with increasing population size. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2005, Edinburgh, UK, September 2-4, pp. 1769–1776. IEEE Press (2005)Google Scholar
  2. 2.
    Hansen, N.: The CMA Evolution Strategy: A Tutorial, (version of June 28, 2011)
  3. 3.
    Martin, W.N., Lienig, J., Cohoon, J.P.: Island (migration) models: evolutionary algorithms based on punctuated equilibria. In: Handbook of Evolutionary Computation, pp. pp. C6.3:1–C6.3:16. Institute of Physics Publishing, Bristol (1997)Google Scholar
  4. 4.
    Müller, C.L., Baumgartner, B., Sbalzarini, I.F.: Particle swarm CMA evolution strategy for the optimization of multi-funnel landscapes. In: Proceedings of the Eleventh Congress on Evolutionary Computation, CEC 2009, pp. 2685–2692. IEEE Press (2009),
  5. 5.
    Preuss, M.: Niching the CMA-ES via nearest-better clustering. In: Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO 2010, pp. 1711–1718. ACM (2010)Google Scholar
  6. 6.
    Preuss, M., Schönemann, L., Emmerich, M.: Counteracting genetic drift and disruptive recombination in (μ + /, λ)-EA on multimodal fitness landscapes. In: Beyer, H.G., et al. (eds.) Proc. Genetic and Evolutionary Computation Conf. (GECCO 2005), Washington D.C, vol. 1, pp. 865–872. ACM Press, New York (2005)Google Scholar
  7. 7.
    Preuss, M., Stoean, C., Stoean, R.: Niching foundations: basin identification on fixed-property generated landscapes. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011, pp. 837–844. ACM (2011)Google Scholar
  8. 8.
    Shir, O.M., Emmerich, M., Bäck, T.: Adaptive Niche Radii and Niche Shapes Approaches for Niching with the CMA-ES. Evolutionary Computation 18(1), 97–126 (2010)CrossRefGoogle Scholar
  9. 9.
    Singh, G., Deb, K.: Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, GECCO 2006, pp. 1305–1312. ACM (2006)Google Scholar
  10. 10.
    Stoean, C., Preuss, M., Stoean, R., Dumitrescu, D.: Multimodal optimization by means of a topological species conservation algorithm. IEEE Transactions on Evolutionary Computation 14(6), 842–864 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Mike Preuss
    • 1
  1. 1.Chair of Algorithm Engineering, Computational Intelligence Group, Dept. of Computer ScienceTechnische Universität DortmundDortmundGermany

Personalised recommendations