-
Notifications
You must be signed in to change notification settings - Fork 0
/
random_selector.py
50 lines (36 loc) · 1.63 KB
/
random_selector.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
from pygenalgo.genome.chromosome import Chromosome
from pygenalgo.operators.selection.select_operator import SelectionOperator
class RandomSelector(SelectionOperator):
"""
Description:
Random Selector implements selection assuming that all members of the population
have the same probability to be selected as parents 1/N, effectively assuming a
uniform probability.
It does not favour the fit individuals therefore the mixing will be very slow.
"""
def __init__(self, select_probability: float = 1.0):
"""
Construct a 'RandomSelector' object with a given probability value.
:param select_probability: (float) in [0, 1].
"""
# Call the super constructor with the provided probability value.
super().__init__(select_probability)
# _end_def_
def select(self, population: list[Chromosome]):
"""
Select the individuals, from the input population, that will be passed on
to the next genetic operations of crossover and mutation to form the new
population of solutions.
:param population: a list of chromosomes to select the parents from.
:return: the selected parents population (as list of chromosomes).
"""
# Get the length of the population list.
N = len(population)
# Increase the selection counter.
self.inc_counter()
# Select 'N' new individuals (indexes).
index = self.rng.choice(N, size=N, replace=True, shuffle=False)
# Return the new parents (individuals).
return [population[i] for i in index]
# _end_def_
# _end_class_