Repository navigation
Expand file tree
/
Copy pathGeneticAlgorithm.java
More file actions
84 lines (69 loc) · 1.89 KB
/
Copy pathGeneticAlgorithm.java
File metadata and controls
84 lines (69 loc) · 1.89 KB
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
73
74
75
76
77
78
79
80
81
82
83
84
//===========================================================
// title = GeneticAlgorithm.java0
// by = Brian Kim
// description = the main class for the genetic algorithm
// implementation
//===========================================================
package geneticalgorithm;
public abstract class GeneticAlgorithm
{
//
// properties (instance variables)
//
// a generation object that will control our chromosomes
// - has an internal array of chromosomes
// - keeps track of the current generation count
// - evolve(): updates internal array of fitness values with
// internal fitness function
public Generation generation;
//
// accessor methods
//
public Generation getGeneration() {return this.generation;}
protected double target_fitness;
protected int options;
//
// constructor methods
//
public GeneticAlgorithm()
{
this( 8 );
}
public GeneticAlgorithm( int pop_size )
{
this( new Generation(pop_size) {
@Override
protected FitnessFunction fitness_function() {
return null;
}
@Override
protected Chromosome[] initial_population( int n ) {
return null;
}
});
}
public GeneticAlgorithm( Generation gen )
{
this( gen, 0.95 );
}
public GeneticAlgorithm( Generation gen , double target_fit )
{
this.generation = gen;
this.target_fitness = target_fit;
}
//
// important API
//
// evolve the generation
// returns whether or not the most fit chromosome
// beats the fitness function
public boolean evolve()
{
this.generation.evolve();
if (generation.rateMostFit() >= this.target_fitness)
{
return true;
}
return false;
}
}