An introduction to genetic algorithms
An introduction to genetic algorithms
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
On Decentralizing Selection Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
IEEE Transactions on Computers
Selection intensity in asynchronous cellular evolutionary algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
| Hi-index | 0.00 |
We investigate the effect that population structure has upon the course of artificial evolution. We represent an arbitrary population structure by embedding a population of individuals in a graph. Each individual resides at a vertex of the graph and can only choose a mating partner from among its neighbors in the graph. Each individual mates with the selected partner and is replaced by the resultant offspring in the next generation. We embed populations in a variety of trees and mesh-structured graphs and observe differences in rates of change of average fitness and percent polymorphism over successive generations. Results indicate that populations embedded in sparse random graphs having relatively low diameter yield results similar to those embedded in complete graphs.