Selection in Massively Parallel Genetic Algorithms

Selection in Massively Parallel Genetic Algorithms (1991)

by Robert J. Collins , David R. Jefferson

Venue:	PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS
Citations:	121 - 1 self

User correction supplied by mph

Datum	Value	Source
TITLE	Selection in Massively Parallel Genetic Algorithms	INFERENCE
AUTHOR NAME	Robert J. Collins	user correction
AUTHOR AFFIL	Artificial Life Laboratory; Department of Computer Science; University of California, Los Angeles	user correction
AUTHOR ADDR	Los Angeles, CA 90024	user correction
AUTHOR NAME	David R. Jefferson	user correction
AUTHOR AFFIL	Artificial Life Laboratory; Department of Computer Science; University of California, Los Angeles	user correction
AUTHOR ADDR	Los Angeles, CA 90024	user correction
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.	user correction
YEAR	1991	INFERENCE
VENUE	PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	249--256	INFERENCE
CITATIONS	18 found	ParsCit 1.0