Abstract
Many real-world optimization problems occur in environments that change dynamically or involve stochastic components. Evolutionary algorithms and other bio-inspired algorithms have been widely applied to dynamic and stochastic problems. This survey gives an overview of major theoretical developments in the area of runtime analysis for these problems. We review recent theoretical studies of evolutionary algorithms and ant colony optimization for problems where the objective functions or the constraints change over time. Furthermore, we consider stochastic problems with various noise models and point out some directions for future research.
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
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Neumann, F., Pourhassan, M., Roostapour, V. (2020). Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. In: Doerr, B., Neumann, F. (eds) Theory of Evolutionary Computation. Natural Computing Series. Springer, Cham. https://doi.org/10.1007/978-3-030-29414-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-29414-4_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29413-7
Online ISBN: 978-3-030-29414-4
eBook Packages: Computer ScienceComputer Science (R0)