Genetic Algorithms in Time-Dependent Environments
Christopher Ronnewinkel, Claus O. Wilke, Thomas Martinetz
Abstract
The influence of time-dependent fitnesses on the infinite population dynamics of simple genetic algorithms (without crossover) is analyzed. Based on general arguments, a schematic phase diagram is constructed that allows one to characterize the asymptotic states in dependence on the mutation rate and the time scale of changes. Furthermore, the notion of regular changes is raised for which the population can be shown to converge towards a generalized quasispecies. Based on this, error thresholds and an optimal mutation rate are approximately calculated for a generational genetic algorithm with a moving needle-in-the-haystack landscape. The so found phase diagram is fully consistent with our general considerations.
Create a lesson
Related papers
A Variational Framework for Nonlinear Chemical Thermodynamics Employing the Maximum Energy Dissipation Principle
Adam Moroz
Retrievable but Unencountered: The Missing Exposure Denominator in Large Academic Ebook Collections
Jette Veenstra, Mauricio Munoz Arias
Where Energy Is Spent Sets the Depth of Kinetic Proofreading
Uğur Çetiner
On the Role of Dispersion in One Model of Propagation of Elastic Excitations in Nerves
Alexander I. Kozlov
Quantifying the Biophysical Properties of Red Blood Cells in Gaucher Disease
Zhaojie Chai, Marine de Person, Pierre A. Buffet et al.
Roles of vortices and turbulent eddies in particle preferential concentration and deposition in the human respiratory tract
Mengtao Li, Yawei Wang, Wentao Feng et al.