Selection in Massively Parallel Genetic Algorithms (1991) [121 citations — 1 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Robert J. Collins and David R. Jefferson},
title = {Selection in Massively Parallel Genetic Algorithms},
booktitle = {Proceedings of the Fourth International Conference on Genetic Algorithms},
year = {1991},
pages = {249--256},
publisher = {Morgan Kaufmann}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
The availability of massively parallel computers makes it possible to apply genetic algorithms to large populations and very complex applications. Among these applications are studies of natural evolution in the emerging field of artificial life, which place special demands on the genetic algorithm. In this paper, we characterize the difference between panmictic and local selection/mating schemes in terms of diversity of alleles, diversity of genotypes, the inbreeding coefficient, and the speed and robustness of the genetic algorithm. Based on these metrics, local mating appears to not only be superior to panmictic for artificial evolutionary simulations, but also for more traditional applications of genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann, 1991. 1 1 Introduction The availability of powerful supercomputers such as the Connection Machine (Hillis 1985) means that genetic algorithms are now applied to l...
