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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bäck, T. (1998). On the behavior of evolutionary algorithms in dynamic environments. In IEEE Int.Conf.on Evolutionary Computation (pp. 446–451). IEEE Press.
Branke, J. (1999a). Evolutionary approaches to dynamic optimization problems: A survey. In J. Branke & T. Bäck (Eds.), Evolutionary algorithms for dynamic optimization problems (pp. 134–137). (part of GECCO Workshops, A. Wu (ed.))
Branke, J. (1999b). Memory enhanced evolutionary algorithms for changing optimization problems. In 1999 Congress on Evolutionary Computation (pp. 1875–1882). Piscataway, NJ: IEEE Service Center.
Cobb, H. G. (1990). An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments (Tech. Rep. No. 6760 (NLR Memorandum)). Washington, D.C.: Navy Center for Applied Research in Artificial Intelligence.
Collard, P., Escazut, C., & Gaspar, A. (1996). An evolutionary approach for time dependant optimization. In Int. Conf. on Tools for Artificial Intelligence 96 (pp. 2–9). IEEE Computer Society Press.
De Jong, K. (2000). Evolving in a changing world. In Z. Ras & A. Skowron (Eds.), Foundation of intelligent systems (pp. 513–519). Berlin: Springer.
Ghozeil, A., & Fogel, D. B. (1996). A preliminary investigation into directed mutations in evolutionary algorithms. In H. Voigt, W. Ebeling, & I. Rechenberg (Eds.), Parallel Problem Solving from Nature — PPSN IV (Berlin, 1996) (Lecture Notes in Computer Science 1141) (pp. 329–335). Berlin: Springer.
Goldberg, D. E., & Smith, R. E. (1987). Nonstationary function optimization using genetic algorithms with dominance and diploidy. In J. J. Grefenstette (Ed.), Proc. of the Second Int. Conf. on Genetic Algorithms (pp. 59–68). Hillsdale, NJ: Lawrence Erlbaum Associates.
Hildebrand, L., Reusch, B., & Fathi, M. (1999). Directed mutation — A new self-adaptation for evolutionary strategies. In 1999 Congress on Evolutionary Computation (pp. 1550–1557). Piscataway, NJ: IEEE Service Center.
Jones, T. (1995). Evolutionary algorithms, fitness landscapes and search.Unpublished doctoral dissertation, The University of New Mexico, Albuquerque, NM.
Liles, W., & De Jong, K. A. (1999). The usefulness of tag bits in changing environments. In 1999 Congress on Evolutionary Computation (pp. 2054–2060). Piscataway, NJ: IEEE Service Center.
Mori, N., Kita, H., & Nishikawa, Y. (1996). Adaptation to a changing environment by means of the thermodynamical genetic algorithm. In H. Voigt, W. Ebeling, & I. Rechenberg (Eds.), Parallel Problem Solving from Nature — PPSN IV (Berlin, 1996) (Lecture Notes in Computer Science 1141) (pp. 513–522). Berlin: Springer.
Morrison, R. W., & De Jong, K. A. (1999). A test problem generator for non-stationary environments. In 1999 Congress on Evolutionary Computation (pp. 2047–2053). Piscataway, NJ: IEEE Service Center.
Rechenberg, I. (1994). Evolutionsstrategie’ 94. Stuttgart: frommann-holzbog. (German)
Saleem, S., & Reynolds, R. (2000). Cultural algorithms in dynamic environments. In Proc. of the 2000 Congress on Evolutionary Computation (pp. 1513–1520). Piscataway, NJ: IEEE Service Center.
Schwefel, H.-P. (1995). Evolution and optimum seeking. New York: Wiley.
Vavak, F., Fogarty, T. C., & Jukes, K. (1996). A genetic algorithm with variable range of local search for tracking changing environments. In H.-M. Voigt, W. Ebeling, I. Rechenberg, & H.-P. Schwefel (Eds.), Parallel problem solving from nature — PPSN IV (pp. 376–385). Berlin: Springer.
Weicker, K., & Weicker, N. (1999). On evolution strategy optimization in dynamic environments. In 1999 Congress on Evolutionary Computation (pp. 2039–2046). Piscataway, NJ: IEEE Service Center.
Weicker, K., & Weicker, N. (2000). Dynamic rotation and partial visibility. In Proc. of the 2000 Congress on Evolutionary Computation (pp. 1125–1131). Piscataway, NJ: IEEE Service Center.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 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
DOI: https://doi.org/10.1007/3-540-45493-4_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42732-2
Online ISBN: 978-3-540-45493-9
eBook Packages: Springer Book Archive