blob: 3e7b590e4b77d828a5931c21d78cacb36df26b82 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
package jcgp.population;
import jcgp.parameters.Parameters;
public class Population {
private Chromosome[] parents;
private Chromosome[] offspring;
private Chromosome bestIndividual;
public Population(Chromosome parent) {
parents = new Chromosome[Parameters.getParentCount()];
// make a clone for safety
this.parents[0] = new Chromosome(parent);
// generate the rest of parents
for (int c = 1; c < parents.length; c++) {
parents[c] = new Chromosome();
}
offspring = new Chromosome[Parameters.getOffspringCount()];
for (int c = 0; c < offspring.length; c++) {
// completely random offspring? depending on EA, this means the given parent won't be selected
offspring[c] = new Chromosome();
}
}
public Population() {
parents = new Chromosome[Parameters.getParentCount()];
for (int c = 0; c < parents.length; c++) {
parents[c] = new Chromosome();
}
offspring = new Chromosome[Parameters.getOffspringCount()];
for (int c = 0; c < offspring.length; c++) {
offspring[c] = new Chromosome();
}
}
public Chromosome getOffspring(int index) {
return offspring[index];
}
public Chromosome getParent(int index) {
return parents[index];
}
/**
* Returns all chromosomes, parents first, then offspring.
*
* @param index
* @return
*/
public Chromosome getChromosome(int index) {
if (index < parents.length) {
return parents[index];
} else {
return offspring[index - parents.length];
}
}
public void setBestIndividual(int index) {
if (index < parents.length) {
bestIndividual = parents[index];
} else {
bestIndividual = offspring[index - parents.length];
}
}
public Chromosome getBestIndividual() {
return bestIndividual;
}
}
|
