Premature Convergence in Constrained Continuous Search Spaces

  • Oliver Kramer
Conference paper

DOI: 10.1007/978-3-540-87700-4_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5199)
Cite this paper as:
Kramer O. (2008) Premature Convergence in Constrained Continuous Search Spaces. In: Rudolph G., Jansen T., Beume N., Lucas S., Poloni C. (eds) Parallel Problem Solving from Nature – PPSN X. PPSN 2008. Lecture Notes in Computer Science, vol 5199. Springer, Berlin, Heidelberg

Abstract

The optimum of numerical problems quite often lies on the constraint boundary or even in a vertex of the feasible search space. In such cases the evolutionary algorithm (EA) frequently suffers from premature convergence because of a low success probability near the constraint boundaries. We analyze premature fitness stagnation and the success rates experimentally for an EA using self-adaptive step size control. For a (1+1)-EA with a Rechenberg-like step control mechanism we prove premature step size reduction at the constraint boundary. The proof is based on a success rate analysis considering a simplified mutation distribution model. From the success rates and the possible state transitions, the expected step size change can be derived at each step. We validate the theoretical model with an experimental analysis.

Keywords

Premature Convergence Constrained Real-Parameter Optimization Evolution Strategies Self-Adaptation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Oliver Kramer
    • 1
  1. 1.Computational Intelligence GroupDortmund University of TechnologyDortmundGermany

Personalised recommendations