Problem Difficulty in Real-Valued Dynamic Problems (original) (raw)

Abstract

The article at hand identifies two kinds of problem difficulty in dynamic environments: discontinuities in the fitness landscape caused by moving optima and the discrepancy between tracking and optimization. These problem dificulties are supported by theoretical considerations and experimental findings.Various methods of resolution are discussed and a new adaptation method, namely the correction of strategy variables, is proposed.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

  1. University of Stuttgart, Institute of Computer Science, Breitwiesenstr. 20-22, 70565, Stuttgart, Germany
    Karsten Weicker

Editor information

Editors and Affiliations

  1. Computer Science I, University of Dortmund, 44221, Dortmund, Germany
    Bernd Reusch

Rights and permissions

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weicker, K. (2001). Problem Difficulty in Real-Valued Dynamic Problems. In: Reusch, B. (eds) Computational Intelligence. Theory and Applications. Fuzzy Days 2001. Lecture Notes in Computer Science, vol 2206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45493-4\_35

Download citation

Keywords

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.

Publish with us