Abstract
In our former paper, we have investigated the relation among the mean convergence time, the population size, and the chromosome length of genetic algorithms (GAs). 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. The Wright-Fisher model is characterized by 1-locus, 2-alleles, fixed population size, and discrete generation. For these simple characters, it is easy to evaluate the behavior of genetic process. We have also given the mean convergence time under genetic drift. Genetic drift can be well described in the Wright-Fisher model, and we have determined the stationary states of the corresponding Markov chain model and the mean convergence time to reach one of these stationary states. The island model is also well-known model in population genetics, and it is similar to one of the most typical model of parallel GAs, which require parallel computer for high performance computing. We have also derived the most effective migration rate for the island model parallel GAs with some restrictions. The obtained most effective migration rate is rather small value, i.e. one immigrant per generation, however the behaviors of the island model parallel GAs at that migration rate are not revealed yet clearly. In this paper, we discuss the mean convergence time for the island model parallel GAs from both of exact solution and numerical simulation. As expected from the Wright-Fisher model’s analysis, the mean convergence time of the island model parallel GAs is proportional to population size, and the coefficient is larger with smaller migration rate. Since to keep the diversity in population is important for effective performance of GAs, the convergence in population gives a bad influence for GAs. On the other hand, mutation and crossover operation prevent converging in GAs population. Because of the small migration rate makes converging force weak, it must be effective for GAs. This means that the island model parallel GAs is more efficient not only to use large population size with parallel computers, but also to keep the diversity in population, than usual GAs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. Asoh and H. Mühlenbein, “On the Mean Convergence Time of Evolutionary Algorithms without Selection”, Parallel Problem Solving from Nature 3 (proceedings), 1994.
A. E. Eiben, E. H. L. Aarts, and K. M. Van Hee, “Global Convergence of Genetic Algorithms: a Markov Chain Analysis”, Parallel Problem Solving from Nature (proceedings), 4–12, 1990.
D. E. Goldberg and P. Segrest, “Finite Markov Chain Analysis of Genetic Algorithms”, Proceedings of the 2nd International Conference on Genetic Algorithms, 1–8, 1987.
D. E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning, Addison-Wesley, Reading, Mass., 1989.
D. L. Hartl and A. G. Clark, Principles of Population Genetics, Second Edition, Sinauer Associates Inc., 1975.
J. H. Holland, Adaptation in Natural and Artificial Systems, Univ. of Michigan Press, Ann Arbor, Mich., 1975.
J. Horn, “Finite Markov Chain Analysis of Genetic Algorithms with Niching”, Proceedings of the 5th International Conference on Genetic Algorithms, 110–117, 1993.
M. Kimura, “Diffusion Models in Population Genetics”, J. Appl. Prob. 1, 177–232, 1964.
B. Manderick and P. Spiessens, “Fine-Grained Parallel Genetic Algorithms”, Proceedings of the 3rd International Conference on Genetic Algorithms, 428–433, 1989.
T. Niwa and M. Tanaka, “On the Mean Convergence Time for Simple Genetic Algorithms”, Proceedings of the International Conference on Evolutionary Computing’ 95, 1995.
T. Niwa and M. Tanaka, “Analyses of Simple Genetic Algorithms and Island Model Parallel Genetic Algorithm”, Artificial Neural Nets and Genetic Algorithms, Proceedings of the International Conference in Norwich, U.K., 1997, 224–228, 1997.
G. Rudolph, “Convergence Analysis of Canonical Genetic Algorithms”, IEEE Transactions on Neural Networks, Vol.5,No.1, 96–101, 1994.
J. Suzuki, “A Markov Chain Analysis on a Genetic Algorithm”, Proceedings of the 5th International Conference on Genetic Algorithms, 146–153, 1993.
M. Tanaka and T. Niwa, “Markov Chain Analysis on Simple Genetic Algorithm”, ETL-TR-94-13, 1994.
R. Tanese, “Distributed Genetic Algorithms”, Proceedings of the 3rd International Conference on Genetic Algorithms, 434–439, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niwa, T., Tanaka, M. (1999). Analysis on the Island Model Parallel Genetic Algorithms for the Genetic Drifts. In: McKay, B., Yao, X., Newton, C.S., Kim, JH., Furuhashi, T. (eds) Simulated Evolution and Learning. SEAL 1998. Lecture Notes in Computer Science(), vol 1585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48873-1_45
Download citation
DOI: https://doi.org/10.1007/3-540-48873-1_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65907-5
Online ISBN: 978-3-540-48873-6
eBook Packages: Springer Book Archive