Abstract
In this paper a multiple subpopulations technique for evolutionary algorithms is proposed. Each subpopulation is distinguished by the mutation radius and mutation probability assigned to it, with mutation radius being a function of mutation probability. Mutation probabilities across the subpopulations range from 0.005 to 0.75. There is no crossover between subpopulations in the normal course of breeding, and the mechanisms of elite migration from a higher mutation subpopulation to the adjacent subpopulation of lower mutation is used to introduce new genetic material. The evolution of artificial neural networks for solving a variety of problems is demonstrated, with convergence times typically half as long as a standard evolutionary algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Davis. Adapting operator probabilities in genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms, pages 61–69, George Mason University, June 4th-7th 1989.
S. Dickman. Chernobyls voles: A spring of genetic surprise. New Scientist, (1990):14, 12th August 1992.
R. Frey and D. Slate. Letter recognition using Holland-style adaptive classisfiers. Machine Learning, 6:161–180, 1991.
R. Tanese. Distributed genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms, pages 434–439, George Mason University, June 4th-7th 1989.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
Copland, H., Hendtlass, T. (1998). Migration through Mutation Space: A Means of Accelerating Convergence in Evolutionary Algorithms. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6492-1_40
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83087-1
Online ISBN: 978-3-7091-6492-1
eBook Packages: Springer Book Archive