-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathevolution.py
More file actions
335 lines (289 loc) · 18.7 KB
/
Copy pathevolution.py
File metadata and controls
335 lines (289 loc) · 18.7 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
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
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
# Core evolution engine for the GP implementation.
# Contains the main VectorEvolutionAlgorithm and EvolutionAlgorithm classes.
from __future__ import annotations
from data import DataSource
from population import Population
from smoothMultifunctionSet import SmoothMultifunctionSet
from typing import Any, Callable
from individual import Individual
from evolutionStrategy import EvolutionStrategy
import math
import random
import time
from copy import deepcopy
class VectorEvolutionAlgorithm:
"""A vector-based genetic programming evolution engine.
Uses flat vector individuals, crossover, and mutation operators to evolve
a population of candidate solutions.
"""
def __init__(self, fList: list, dataSource: DataSource = None, fitnessFunction = None,
dataIndexes: list = None, mutationFunc: Callable = None, crossoverFunc: Callable = None,
rng: random.Random = None, taylorSumElements: int = 100, useTriangleFval: bool = True):
"""Initialize vector evolution settings and propagate function set parameters."""
self.population = Population()
self.fList = fList
self.fitnessValues = []
self.dataSource = dataSource
self.variableList = None
self.fitnessFunction = fitnessFunction
self.dataIndexes = dataIndexes
self.mutationFunc = mutationFunc
self.crossoverFunc = crossoverFunc
self.rng = rng if rng is not None else random.Random()
self.taylorSumElements = taylorSumElements
self.useTriangleFval = useTriangleFval
for func in self.fList:
if hasattr(func, "taylorSumElements"):
func.taylorSumElements = taylorSumElements
if hasattr(func, "useTriangleFval"):
func.useTriangleFval = useTriangleFval
for func in self.fList:
if hasattr(func, "useTriangleFval") and func.useTriangleFval != useTriangleFval:
raise ValueError(
f"Unable to configure useTriangleFval={useTriangleFval} on function set {func}"
)
def initFitnessValues(self, populationSize: int = 0):
"""Initialize the fitness value list for the population."""
self.fitnessValues = [-1] * populationSize
def runEvolution(self, maxGenerations: int = 100, populationSize: int = 100, depth: int = 4, mutationRate: float = 0.01,
randomIndividualRate: float = 0.1, variableProbability: float = 0.5,
minTerminalNodeVal: float = 0, maxTerminalNodeVal: float = 10, maxSeconds: float | None = None) -> Individual | None:
"""Run the vector evolution loop and return the best found individual."""
self.variableList = self.dataSource.createVariableList()
self.population.initializePopulationFullRandomMethod(populationSize = populationSize, depth = depth, funcList= self.fList,
variableList = self.variableList, variableProbability = variableProbability,
minTerminalNodeVal = minTerminalNodeVal, maxTerminalNodeVal = maxTerminalNodeVal,
rng=self.rng)
self.initFitnessValues(populationSize = populationSize)
best_fitness = float('-inf')
best_individual = None
best_generation = None
start_time = time.monotonic() if maxSeconds is not None else None
for generation in range(maxGenerations):
print("------------------------ Generation: " + str(generation) + " ------------------------")
#Fitness evaluation
for i in range(populationSize):
self.fitnessValues[i] = self.fitnessFunction.evaluateFitness(individual = self.population.individualList[i],
dataSource = self.dataSource, dataIndexes = self.dataIndexes, fList = self.fList, variableList = self.variableList)
# Summary statistics for fitness
if populationSize > 0:
max_fitness = max(self.fitnessValues)
min_fitness = min(self.fitnessValues)
avg_fitness = sum(self.fitnessValues) / float(populationSize)
print(f"Fitness summary — max: {max_fitness:.4f}, min: {min_fitness:.4f}, avg: {avg_fitness:.4f}")
# Update best individual seen so far
try:
best_idx = self.fitnessValues.index(max_fitness)
candidate = deepcopy(self.population.individualList[best_idx])
if max_fitness > best_fitness:
best_fitness = max_fitness
best_individual = candidate
best_generation = generation
if math.isinf(max_fitness):
print(f"Perfect fit found in GP at generation {generation}. Stopping evolution.")
return candidate
except Exception:
pass
#Selection
newIndividualList = []
sortedIndexes = sorted(range(populationSize), key=lambda k: self.fitnessValues[k], reverse=True)
for i in range(0, populationSize):
idx1 = sortedIndexes[i]
idx2 = sortedIndexes[(i+1) % populationSize]
original = self.population.individualList[idx1]
partner = self.population.individualList[idx2]
new = self.crossoverFunc(ind1=original, ind2=partner, fset=self.fList, varlist=self.variableList,
minTerminalVal=minTerminalNodeVal, maxTerminalVal=maxTerminalNodeVal, rng=self.rng)
scoreOriginal = self.fitnessValues[idx1]
scoreNew = self.fitnessFunction.evaluateFitness(individual = new,
dataSource = self.dataSource, dataIndexes = self.dataIndexes, fList = self.fList, variableList = self.variableList)
if scoreNew >= scoreOriginal:
newIndividualList.append(new)
else:
newIndividualList.append(original)
randomIndividualCount = int(round(randomIndividualRate * populationSize))
for idx in range(randomIndividualCount):
pos = max(0, populationSize - 1 - idx)
new = Individual.createRandomIndividual(
depth=depth,
variableList=self.variableList,
variableProbability=variableProbability,
functionList=self.fList,
minTerminalNodeVal=minTerminalNodeVal,
maxTerminalNodeVal=maxTerminalNodeVal,
rng=self.rng,
)
newIndividualList[pos] = new
#Mutation
for i in range(populationSize):
mutated = deepcopy(self.population.individualList[i])
self.mutationFunc(individual = mutated, mutationRate = mutationRate, fList = self.fList,
minTerminalVal = minTerminalNodeVal, maxTerminalVal = maxTerminalNodeVal,
varlist = self.variableList, variableProbability = variableProbability, rng=self.rng)
originalFitness = self.fitnessValues[i]
mutatedFitness = self.fitnessFunction.evaluateFitness(individual = mutated,
dataSource = self.dataSource, dataIndexes = self.dataIndexes, fList = self.fList, variableList = self.variableList)
if mutatedFitness > originalFitness:
newIndividualList[i] = mutated
self.population.individualList = newIndividualList
if maxSeconds is not None and start_time is not None and (time.monotonic() - start_time) >= maxSeconds:
print("Stopping evolution because maxSeconds was exceeded.")
break
# Po dokončení všech generací vrať nejlepšího jedince
if best_individual is not None:
print("\n=== Best individual found ===")
print(f"Generation: {best_generation}, Fitness: {best_fitness:.6f}")
try:
best_individual.printVerticalTree()
except Exception:
print(str(best_individual))
return best_individual
class EvolutionAlgorithm:
"""A tree-based genetic programming evolution engine.
Uses function-tree individuals with selectable selection, mutation, and crossover.
"""
def __init__(self, smoothMultifunctionSet: SmoothMultifunctionSet, dataSource: DataSource = None, fitnessFunction: Any = None,
dataIndexes: list = None, selectionMethod: Callable = None, mutationFunc: Callable = None, crossoverFunc: Callable = None,
rng: random.Random = None, taylorSumElements: int = 100, useTriangleFval: bool = True):
"""Initialize tree-based evolution settings and configure the function set."""
self.population = Population(smoothMultifunctionSet)
self.fitnessValues = []
self.dataSource = dataSource
self.variableList = None
self.fitnessFunction = fitnessFunction
self.dataIndexes = dataIndexes
self.selectionMethod = selectionMethod
self.mutationFunc = mutationFunc
self.crossoverFunc = crossoverFunc
self.rng = rng if rng is not None else random.Random()
self.evolutionStrategy = None
self.taylorSumElements = taylorSumElements
self.useTriangleFval = useTriangleFval
if smoothMultifunctionSet is not None:
smoothMultifunctionSet.taylorSumElements = taylorSumElements
smoothMultifunctionSet.useTriangleFval = useTriangleFval
self.esParamsSet = False
self.esmaxseconds = None
self.esmaxgenerations = None
self.escrossoverRate = None
self.esmutationRate = None
self.esrandomIndividualRate = None
self.esoriginalIndividualRatio = None
self.esPopulationSize = None
def initEvolutionStrategy(self, evolutionStrategy: EvolutionStrategy):
"""Configure an existing evolution strategy instance."""
self.evolutionStrategy = evolutionStrategy
def initEvolutionStrategy(self, fitnessFunction: Any, selectionMethod: Callable, mutationMethod: Callable, crossoverMethod: Callable):
"""Create and configure a default EvolutionStrategy instance."""
self.evolutionStrategy = EvolutionStrategy(fitnessFunction = fitnessFunction, selectionMethod = selectionMethod,
mutationFunc = mutationMethod, crossoverFunc = crossoverMethod,
dataSource = self.dataSource, dataIndexes = self.dataIndexes,
smoothMultifunctionSet = self.population.smoothMultifunctionSet, variableList = self.variableList,
rng=self.rng)
def initFitnessValues(self, populationSize: int = 0):
"""Initialize the fitness value list for the population."""
self.fitnessValues = [-1] * populationSize
def setEvolutionStrategyParameters(self, crossoverRate: float = 0.8, mutationRate: float = 0.1,
randomIndividualRate: float = 0.1, maxSeconds: float = None, maxGenerations: int = None,
originalIndividualRatio: float = 0.5, populationSize: int = 100) -> None:
"""Set parameters for the evolution strategy before running evolution."""
self.esmaxseconds = maxSeconds
self.esmaxgenerations = maxGenerations
self.escrossoverRate = crossoverRate
self.esmutationRate = mutationRate
self.esrandomIndividualRate = randomIndividualRate
self.esoriginalIndividualRatio = originalIndividualRatio
self.esParamsSet = True
self.esPopulationSize = populationSize
def runEvolution(self, maxGenerations: int = 100, populationSize: int = 100, depth: int = 4,
crossoverRate: float = 0.8, mutationRate: float = 0.1,
randomIndividualRate: float = 0.1, variableProbability: float = 0.5,
minTerminalNodeVal: float = 0, maxTerminalNodeVal: float = 10, tuneConstants: bool = False) -> Individual | None:
"""Run the evolution loop for tree-based individuals and return the best found solution."""
self.variableList = self.dataSource.createVariableList()
self.population.initializePopulationFullRandomMethod(populationSize = populationSize, depth = depth,
variableList = self.variableList, variableProbability = variableProbability,
minTerminalNodeVal = minTerminalNodeVal, maxTerminalNodeVal = maxTerminalNodeVal,
rng=self.rng)
self.initFitnessValues(populationSize = populationSize)
best_fitness = float('-inf')
best_individual = None
best_generation = None
for generation in range(maxGenerations):
print("------------------------ Generation: " + str(generation) + " ------------------------")
#Fitness evaluation
for i in range(populationSize):
self.fitnessValues[i] = self.fitnessFunction.evaluateFitness(individual = self.population.individualList[i],
dataSource = self.dataSource, dataIndexes = self.dataIndexes,
smoothmultifunctionset = self.population.smoothMultifunctionSet, variableList = self.variableList)
# Summary statistics for fitness
if populationSize > 0:
max_fitness = max(self.fitnessValues)
min_fitness = min(self.fitnessValues)
avg_fitness = sum(self.fitnessValues) / float(populationSize)
print(f"Fitness summary — max: {max_fitness:.4f}, min: {min_fitness:.4f}, avg: {avg_fitness:.4f}")
# Update best individual seen so far
try:
best_idx = self.fitnessValues.index(max_fitness)
candidate = deepcopy(self.population.individualList[best_idx])
if max_fitness > best_fitness:
best_fitness = max_fitness
best_individual = candidate
best_generation = generation
if math.isinf(max_fitness):
print(f"Perfect fit found in GP at generation {generation}. Stopping evolution.")
return candidate
except Exception:
pass
#Selection
newIndividualList = []
totalFitness = sum(self.fitnessValues)
while len(newIndividualList) < populationSize:
if self.rng.random() < randomIndividualRate:
newIndividualList.append(Individual.createRandomIndividual(self.population.smoothMultifunctionSet, depth,
variableList = self.variableList, variableProbability = variableProbability,
minTerminalNodeVal = minTerminalNodeVal, maxTerminalNodeVal = maxTerminalNodeVal,
rng=self.rng))
else:
if self.rng.random() < crossoverRate:
selectedIndividual1 = self.selectionMethod(self.population, self.fitnessValues, totalFitness, rng=self.rng)
selectedIndividual2 = self.selectionMethod(self.population, self.fitnessValues, totalFitness, rng=self.rng)
newIndividual1, newIndividual2 = self.crossoverFunc(selectedIndividual1, selectedIndividual2, rng=self.rng)
newIndividualList.append(newIndividual1)
if len(newIndividualList) < populationSize:
newIndividualList.append(newIndividual2)
else:
selectedIndividual = self.selectionMethod(self.population, self.fitnessValues, totalFitness, rng=self.rng)
newIndividual = deepcopy(selectedIndividual)
newIndividualList.append(newIndividual)
#Mutation
for i in range(populationSize):
self.mutationFunc(individual = newIndividualList[i], mutationRate = mutationRate,
minFunctionNodeVal = self.population.smoothMultifunctionSet.minVal,
maxFunctionNodeVal = self.population.smoothMultifunctionSet.maxVal,
minTerminalNodeVal = minTerminalNodeVal, maxTerminalNodeVal = maxTerminalNodeVal,
variableList = self.variableList, variableProbability = variableProbability, rng=self.rng)
if tuneConstants:
if self.esParamsSet:
result = self.evolutionStrategy.tuneConstants(individualList = newIndividualList, maxGenerations = self.esmaxgenerations, maxTimeSeconds = self.esmaxseconds,
minTerminalValue = minTerminalNodeVal, maxTerminalValue = maxTerminalNodeVal,
originalIndividualRatio = self.esoriginalIndividualRatio, randomIndividualRatio = self.esrandomIndividualRate,
crossoverRate = self.escrossoverRate, mutationRate = self.esmutationRate, populationSize = self.esPopulationSize)
else:
result = self.evolutionStrategy.tuneConstants(individualList = newIndividualList, maxGenerations = 100, maxTimeSeconds = 2,
minTerminalValue = minTerminalNodeVal, maxTerminalValue = maxTerminalNodeVal,
originalIndividualRatio = 0.5, randomIndividualRatio = 0.5, crossoverRate = 0.5)
if result is not None:
tuned_individual, tuned_fitness = result
if math.isinf(tuned_fitness):
print("Perfect fit found during constant tuning; stopping GP.")
return tuned_individual
self.population.individualList = newIndividualList
# Po dokončení všech generací vypiš nejlepšího jedince
if best_individual is not None:
print("\n=== Best individual found ===")
print(f"Generation: {best_generation}, Fitness: {best_fitness:.6f}")
try:
best_individual.printVerticalTree()
except Exception:
print(str(best_individual))