Skip to main content

On the Behaviour of the (1+1)-ES for a Simple Constrained Problem

  • Conference paper
Parallel Problem Solving from Nature – PPSN X (PPSN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5199))

Included in the following conference series:

Abstract

This paper studies the behaviour of the (1 + 1)-ES when applied to a linear problem with a single linear constraint. It goes beyond previous work by considering constraint planes that do not contain the gradient direction. The behaviour of the distance of the search point from the constraint plane forms a Markov chain. The limit distribution of that chain is approximated using an exponential model, and progress rates and success probabilities are derived. Consequences for the working of step length adaptation mechanisms based on success probabilities are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnold, D.V.: On the use of evolution strategies for optimising certain positive definite quadratic forms. In: Proceedings of the 2007 Genetic and Evolutionary Computation Conference — GECCO 2007, pp. 634–641. ACM Press, New York (2007)

    Google Scholar 

  2. Arnold, D.V., MacLeod, A.: Step length adaptation on ridge functions. Evolutionary Computation 16(2), 151–184 (2008)

    Article  Google Scholar 

  3. Bäck, T., Fogel, D.B., Michalewicz, Z.: Handbook of Evolutionary Computation. Oxford University Press, Oxford (1997)

    Book  MATH  Google Scholar 

  4. Beyer, H.-G.: Ein Evolutionsverfahren zur mathematischen Modellierung stationärer Zustände in dynamischen Systemen. PhD thesis, Hochschule für Architektur und Bauwesen, Weimar (1989)

    Google Scholar 

  5. Beyer, H.-G.: The Theory of Evolution Strategies. Springer, Heidelberg (2001)

    Book  Google Scholar 

  6. Coello Coello, C.A.: Constraint-handling techniques used with evolutionary algorithms. In: Proceedings of the 2007 Genetic and Evolutionary Computation Conference — GECCO 2007, pp. 3057–3077. ACM Press, New York (2007)

    Google Scholar 

  7. Kramer, O., Schwefel, H.-P.: On three new approaches to handle constraints within evolution strategies. Natural Computing 5(4), 363–385 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Liang, J.J., Runarsson, T.P., Mezura-Montes, E., Clerc, M., Suganthan, P.N., Coello Coello, C.A., Deb, K.: Problem definitions and evaluation criteria for the CEC 2006 Special Session on Constrained Real-Parameter Optimization. Technical report, Nanyang Technological University, Singapore (2006)

    Google Scholar 

  9. Meyer-Nieberg, S., Beyer, H.-G.: Why noise be good: Additive noise on the sharp ridge. In: Proceedings of the 2008 Genetic and Evolutionary Computation Conference — GECCO 2008, may, ACM Press, New York (to appear, 2008)

    Google Scholar 

  10. Montes, E.M., Coello Coello, C.A.: A simple multi-membered evolution strategy to solve constrained optimization problems. IEEE Transactions on Evolutionary Computation 9(1), 1–17 (2005)

    Article  Google Scholar 

  11. Oyman, A.I., Deb, K., Beyer, H.-G.: An alternative constraint handling method for evolution strategies. In: Proc. of the 1999 IEEE Congress on Evolutionary Computation, pp. 612–619. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  12. Rechenberg, I.: Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Friedrich Frommann Verlag (1973)

    Google Scholar 

  13. Rechenberg, I.: Evolutionsstrategie ‘94. Friedrich Frommann Verlag (1994)

    Google Scholar 

  14. Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Computation 4(3), 274–283 (2000)

    Article  Google Scholar 

  15. Schwefel, H.-P.: Numerical Optimization of Computer Models. Wiley, Chichester (1981)

    MATH  Google Scholar 

  16. Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, Chichester (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arnold, D.V., Brauer, D. (2008). On the Behaviour of the (1+1)-ES for a Simple Constrained Problem. 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. https://doi.org/10.1007/978-3-540-87700-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87700-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87699-1

  • Online ISBN: 978-3-540-87700-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics