-
Notifications
You must be signed in to change notification settings - Fork 0
/
evolution_strategy.py
272 lines (208 loc) · 7.05 KB
/
evolution_strategy.py
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
"""
Evolution Strategy
==================
Evolution strategies usually are encoded in R^n, binary
encoding has shown to be inefficient. Nevertheless,
this implementation shows how an evolution strategy works.
Algorithm
---------
- Initialization of population
- Evaluate population
- Loop until 100 generations
- crossover
- three parent recombination
- mutate offsprings
- mutate strategy parameters of offsprings
- add offsprings to population
- selection
Strategy parameters
-------------------
Size of population
MU = 7
Maximum age of a phenotype
KAPPA = 15
Number of offsprings
LAMBDA = 49
Number of parents per offspring
RHO = 3
"""
from random import randint, random, shuffle, gauss
from math import log, pi, exp, sqrt
from copy import copy
from terminalplot import plot
class CylinderPhenotype:
"""Individual (phenotype, creature)
"""
def __init__(self, genotype):
# Genotype (properties, chromosomes)
self.genotype = genotype
self.diameter = None
self.height = None
self.fitness = None
self.constraint = None
# Strategy parameters
self.age = 0
self.p_mutation = 0.01
def __str__(self):
return ''.join([
"Gen: ", self.genotype[:5], ".", self.genotype[5:],
" H: ", str(self.height),
"\tD: ", str(self.diameter),
"\tSurface: ", str(self.fitness),
"\tVolume: ", str(self.constraint),
"\tAge: ", str(self.age),
"\tp_mutation: ", str(self.p_mutation)
])
def decode(self):
self.diameter = binary_to_real(self.genotype[:5])
self.height = binary_to_real(self.genotype[5:])
return [self.diameter, self.height]
def evaluate(self):
# surface
self.fitness = pi*self.diameter**2/2 + pi*self.diameter*self.height
# volume greater than 300
self.constraint = pi*self.diameter**2*self.height/4 >= 300
return [self.fitness, self.constraint]
"""Genetic algorithm methodologies
"""
def initialize_population(size):
population = []
for _ in range(size):
population.append(CylinderPhenotype(
# Random Genotype of length 10
''.join([str(randint(0,1)) for _ in range(10)])
))
population[-1].decode()
population[-1].evaluate()
return population
def next_generation(population):
next_generation = crossover(population)
next_generation = select_phenotypes(next_generation)
# Evaluate creatures
for phenotype in next_generation:
phenotype.decode()
phenotype.evaluate()
phenotype.age += 1
return next_generation
def select_phenotypes(population, mu=7, kappa=15):
"""
Rank based selection (Stochastic universal sampling)
"""
# list, sorted by rank and filtered by constraint
sorted_population = sorted( [creature for creature in population if creature.constraint and creature.age < kappa],
key=lambda ind: ind.fitness,
reverse=False )
# List with boundaries of interval for rank probability
probability_interval = get_probability_interval(len(sorted_population))
selection = []
for _ in range(mu):
rand = random()
for i, sub_interval in enumerate(probability_interval):
if rand <= sub_interval:
break
# selected individuals are copied into selection
# otherwise several items in selection would point
# to the same individual.
selection.append(copy(sorted_population[i]))
return selection
def get_probability_interval(max_rank):
"""
Create list with probability of ranks, interval
of rank 1 is first in list
"""
sum_ranks = max_rank*(max_rank+1)/2
interval = [float(max_rank)/sum_ranks]
for rank in range(max_rank-1,0,-1):
interval.append( interval[-1] + float(rank)/sum_ranks )
return interval
def mutate(population):
for phenotype in population:
phenotype.p_mutation = mutate_strategy(phenotype.p_mutation)
phenotype.genotype = random_genotype_mutation( phenotype.genotype,
phenotype.p_mutation )
return population
def mutate_strategy(sigma):
"""
non-isotropic mutation
sigma: mutation strength
"""
# tau: learning rate
tau = 1/(sqrt(2))
return exp( tau*gauss(0,1) )*sigma
def random_genotype_mutation(genotype, probability):
"""
Inverts each bit of genotype with probability p.
"""
mutation = []
for bit in genotype:
if random() <= probability:
bit = '0' if bit == '1' else '1'
mutation.append(bit)
return ''.join(mutation)
def crossover(population, nr_offsprings=49):
offsprings = []
while len(offsprings) < 49:
# randomly select three distinct parents
shuffle(population)
p1 = population.pop()
p2 = population.pop()
p3 = population.pop()
# Create new genotype
offspring_genotype = three_parent_recombine(p1.genotype, p2.genotype, p3.genotype)
# Create new phenotype from genotype
offsprings.append(CylinderPhenotype(offspring_genotype))
offsprings[-1].decode()
offsprings[-1].evaluate()
# Put parents back into population
population.append(p1)
population.append(p2)
population.append(p3)
# Mutate offsprings and append to population
offsprings = mutate(offsprings)
population += offsprings
return population
def three_parent_recombine(gen1, gen2, gen3):
p1 = randint(0,min(len(gen1),len(gen2)))
p2 = randint(0,min(len(gen1),len(gen2)))
return gen1[:min(p1,p2)]+gen2[min(p1,p2):max(p1,p2)]+gen3[max(p1,p2):]
def get_champion(population):
fitness = None
champion = None
for phenotype in population:
if phenotype.constraint and (not fitness or phenotype.fitness < fitness):
fitness = phenotype.fitness
champion = phenotype
return copy(champion)
"""Encoding and Decoding
"""
def binary_to_real(bin_string, min=0, step=1):
base = 1
num = 0
for i in bin_string[::-1]:
num += base*int(i)
base *= 2
return num
"""Plot
"""
def create_summary(population):
"""
Plot fitness of the best individual of each generation
"""
plot(range(len(population)),[phenotype.fitness for phenotype in population])
superchamp = get_champion(population)
print(''.join([
'Superchamp Diameter: ', str(superchamp.diameter),
' Height: ', str(superchamp.height),
' Surface: ', str(superchamp.fitness)
]))
def main():
SIZE_POPULATION = 7
NUMBER_GENERATIONS = 100
population = initialize_population(size=SIZE_POPULATION)
champions = []
for _ in range(NUMBER_GENERATIONS):
population = next_generation(population)
champions.append(get_champion(population))
create_summary(champions)
if __name__ == '__main__':
main()