1998 | OriginalPaper | Buchkapitel
Analyses of Simple Genetic Algorithms and Island Model Parallel Genetic Algorithms
verfasst von : T. Niwa, M. Tanaka
Erschienen in: Artificial Neural Nets and Genetic Algorithms
Verlag: Springer Vienna
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
H. Asoh and H. Mühlenbein investigated empirically the relation among the mean convergence time, the population size, and the chromosome length of genetic algorithms (GAs). In this paper, from the mathematical point of view, the relation they revealed is convincing. Our analyses of GAs make use of the Markov chain formalism based on the Wright-Fisher model, which is a typical and well-known model in population genetics. We also give the mean convergence time under genetic drift. Genetic drift can be described by the Wright-Fisher model. We determine the stationary states of the corresponding Markov chain model and the mean convergence time to reach one of these stationary states. Furthermore, we derive the most effective mutation rate for the standard GAs and also the most effective migration rate for the island model parallel GAs with some restrictions. These rates are coincide with known empirical results.