Genetic Algorithms: An Example

Generation Genomes Fitness Individuals selected for mating
1 0 1 0 1 1 1 1 0
1 0 1 1 1 0 0 0
0 0 0 0 1 0 1 0
0 0 0 0 0 1 0 0
3 (.3)
4 (.4)
2 (.2)
1 (.1)
0 1 | 0 1 1 1 1 0
1 0 | 1 1 1 0 0 0
1 0 1 1 1 | 0 0 0
0 0 0 0 1 | 0 1 0
2 1 0 0 1 1 1 1 0
0 1 1 1 1 0 0 0
0 0 0 0 1 0 0 0
1 0 1 1 1 0 1 0
2 (.2)
4 (.4)
1 (.1)
3 (.3)
0 1 1 1 1 | 0 0 0
1 0 1 1 1 | 0 1 0
0 1 1 1 | 1 0 0 0
1 0 1 1 | 1 0 1 0
3 1 0 1 1 1 0 0 0
0 1 1 1 1 0 1 0
1 0 1 1 1 0 0 0
0 1 1 1 1 0 1 0
4 (.29)
3 (.21)
4 (.29)
3 (.21)
1 0 | 1 1 1 0 0 0
0 1 | 1 1 1 0 1 0
1 0 1 1 1 | 0 0 0
0 1 1 1 1 | 0 1 0


[IU Bloomington] [IU Cognitive Science] [Q351]

Last updated: 16 April 1996
URL: http://www.indiana.edu/~gasser/Q351/ga2.html
Comments: gasser@salsa.cs.indiana.edu
Copyright 1996, The Trustees of Indiana University