-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathoptimizer_simple.go
More file actions
89 lines (71 loc) · 2.36 KB
/
optimizer_simple.go
File metadata and controls
89 lines (71 loc) · 2.36 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
85
86
87
88
89
package genetic_algorithm
import (
log "github.com/cihub/seelog"
"math/rand"
)
type SimpleOptimizer struct {
*OptimizerBase
crossoverProbability float64
elitism int
secondPopulation Chromosomes
}
func NewSimpleOptimizer() *SimpleOptimizer {
optimizer := &SimpleOptimizer{}
optimizer.OptimizerBase = NewOptimizerBase(optimizer)
return optimizer
}
func (optimizer *SimpleOptimizer) Elitism(elitism int) *SimpleOptimizer {
optimizer.elitism = elitism
return optimizer
}
func (optimizer *SimpleOptimizer) CrossoverProbability(crossoverProbability float64) *SimpleOptimizer {
optimizer.crossoverProbability = crossoverProbability
return optimizer
}
func (optimizer *SimpleOptimizer) optimizeInner() {
optimizer.breed()
optimizer.mutate()
}
func (optimizer *SimpleOptimizer) breed() {
optimizer.statistics.Start("breed")
defer optimizer.statistics.End()
if optimizer.secondPopulation == nil {
optimizer.secondPopulation = make(Chromosomes, optimizer.elitism, optimizer.popSize)
} else {
optimizer.secondPopulation = optimizer.secondPopulation[:optimizer.elitism]
}
copy(optimizer.secondPopulation, optimizer.population[:optimizer.elitism])
optimizer.selector.Prepare(optimizer.population)
for {
chromsToCross := optimizer.selector.SelectMany(optimizer.crossover.ParentsCount())
log.Debugf("Parents:\n%v", chromsToCross)
var newChromosomes Chromosomes
if optimizer.crossoverProbability > rand.Float64() {
newChromosomes = optimizer.crossover.Crossover(chromsToCross)
log.Debugf("Children\n%v\n", newChromosomes)
} else {
log.Debugf("Parents go to the new generation\n")
newChromosomes = chromsToCross
}
for i := 0; i < len(newChromosomes); i++ {
optimizer.secondPopulation = append(optimizer.secondPopulation, newChromosomes[i])
if len(optimizer.secondPopulation) == optimizer.popSize {
optimizer.population, optimizer.secondPopulation = optimizer.secondPopulation, optimizer.population
return
}
}
}
}
func (optimizer *SimpleOptimizer) mutate() {
optimizer.statistics.Start("mutate")
defer optimizer.statistics.End()
optimizer.mutator.Mutate(optimizer.population)
}
func (optimizer *SimpleOptimizer) check() {
if optimizer.elitism < 0 {
panic("Elitism must be positive")
}
if optimizer.crossoverProbability <= 0 || optimizer.crossoverProbability > 1 {
panic("CrossoverProbability must be in (0, 1] range")
}
}