Migration through Mutation Space: A Means of Accelerating Convergence in Evolutionary Algorithms
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.
KeywordsEvolutionary Algorithm Mutation Probability Lower Mutation Parallel Genetic Algorithm Mutation Environment
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- S. Dickman. Chernobyls voles: A spring of genetic surprise. New Scientist, (1990):14, 12th August 1992.Google Scholar
- R. Frey and D. Slate. Letter recognition using Holland-style adaptive classisfiers. Machine Learning, 6:161–180, 1991.Google Scholar
- 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.Google Scholar