This repository was archived by the owner on Jun 7, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPopulation.py
More file actions
54 lines (41 loc) · 1.55 KB
/
Population.py
File metadata and controls
54 lines (41 loc) · 1.55 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
import numpy as np
from Individual import Individual
class Population:
def __init__(self, individuals_array=[]):
self.individuals = []
if len(individuals_array) > 0:
for x in individuals_array:
self.add_individual_from_array(x)
self.fitness = []
def __str__(self):
out = []
i = 0
for individual in self.individuals:
out.append(f"Individual {i}: {str(individual)}")
i += 1
return "[\n" + ",\n".join(out) + "\n]"
def add_individual(self, individual):
self.individuals.append(individual)
def add_individual_from_array(self, array):
individual = Individual()
for i in range(0, len(array), 2):
individual.add_parameter(array[i], array[i + 1])
self.add_individual(individual)
def get_population_size(self):
return len(self.individuals)
def calculate_fitness(self):
self.fitness = []
for individual in self.individuals:
self.fitness.append(individual.g())
def get_fitness_ratios(self):
total_fitness = np.sum(self.fitness)
ratios = []
for value in self.fitness:
ratios.append(value / total_fitness)
return ratios
def get_most_fit_individuals(self, n):
sorted_fitness = np.sort(self.fitness)[::-1] # Fitnesses in decreasing order
top_individuals = []
for i in range(n):
top_individuals.append(self.individuals[self.fitness.index(sorted_fitness[i])])
return top_individuals