Abstract
This work introduces a general mathematical framework for non-stationary fitness functions which enables the exact definition of certain problem properties. The properties' influence on the severity of the dynamics is analyzed and discussed. Various different classes of dynamic problems are identified based on the properties. Eventually, for an exemplary model search space and a (1, λ)-strategy, the interrelation of the offspring population size and the success rate is analyzed. Several algorithmic techniques for dynamic problems are compared for the different problem classes.
Cite
CITATION STYLE
Weicker, K. (2000). An analysis of dynamic severity and population size. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1917, pp. 159–168). Springer Verlag. https://doi.org/10.1007/3-540-45356-3_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
