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
use rand::distributions::{Standard, Uniform};
use rand::prelude::*;
use rayon::prelude::*;
use std::ops::Range;
use std::sync::mpsc::channel;
use SelectionFunctions::*;
pub trait Selection: Send + Sync {
fn select(&self, fitnesses: &[f64], selection_rate: usize) -> Vec<usize>;
}
pub struct NTournaments(pub usize);
pub enum SelectionFunctions {
Roulette,
Tournaments(NTournaments),
Cup,
}
impl Selection for SelectionFunctions {
fn select(&self, fitnesses: &[f64], selection_rate: usize) -> Vec<usize> {
match self {
Roulette => {
let mut rgen = SmallRng::from_entropy();
let mut winners = Vec::with_capacity(selection_rate);
let mut probs = Vec::with_capacity(fitnesses.len());
let fitness_sum: f64 = fitnesses.iter().sum();
for fit in fitnesses {
probs.push(fit / fitness_sum);
}
for _i in 0..selection_rate {
let random: f64 = rgen.sample(Standard);
let mut accum = 0_f64;
for (ind, p) in probs.iter().enumerate() {
if random <= accum + p {
winners.push(ind);
break;
}
accum += p;
}
}
winners
}
Tournaments(n_tournaments) => {
let (sender, receiver) = channel();
let mut winners = Vec::with_capacity(n_tournaments.0);
Range {
start: 0,
end: n_tournaments.0,
}
.into_par_iter()
.for_each_with(sender, |s, _t| {
let mut rgen = SmallRng::from_entropy();
let mut fighters = Vec::with_capacity(selection_rate);
for _f in 0..selection_rate {
let sel = rgen.sample(Uniform::from(0..fitnesses.len()));
fighters.push((sel, fitnesses[sel]));
}
s.send(
fighters
.par_iter()
.max_by(|x, y| x.1.partial_cmp(&y.1).unwrap())
.unwrap()
.0,
)
.unwrap();
});
for win in receiver {
winners.push(win);
}
winners
}
Cup => {
let mut rgen = SmallRng::from_entropy();
let mut winners = Vec::with_capacity(2_i32.pow(selection_rate as u32) as usize - 1);
let n_phases = (fitnesses.len() as f64).log2() as usize + 1;
let mut phases: Vec<Vec<(usize, f64)>> = Vec::with_capacity(n_phases);
for i in 0..n_phases {
let size = 2_i32.pow(i as u32) as usize;
phases.push(Vec::with_capacity(size));
for _j in 0..size {
phases[i].push((0, 0_f64));
}
}
let mut candidates = Vec::with_capacity(fitnesses.len());
for f in fitnesses {
candidates.push(*f);
}
{
let last_phase = &mut phases[n_phases - 1];
let mut i = 0;
while i < last_phase.len() {
let sel = rgen.sample(Uniform::from(0..candidates.len()));
last_phase[i] = (sel, candidates[sel]);
candidates.remove(sel);
i += 1;
}
}
Self::cup_phase_fight(&mut phases, n_phases - 1);
for phase in phases
.iter()
.enumerate()
.filter(|(i, _p)| *i < selection_rate as usize)
.map(|(_i, p)| p)
{
for winner in phase.iter() {
if winners.is_empty() {
winners.push(winner.0);
} else {
let index = rgen.sample(Uniform::from(0..winners.len()));
winners.insert(index, winner.0);
}
}
}
winners
}
}
}
}
impl SelectionFunctions {
fn cup_phase_fight(phases: &mut Vec<Vec<(usize, f64)>>, phase: usize) {
let (sender, receiver) = channel();
Range {
start: 0,
end: phases[phase].len() / 2,
}
.into_par_iter()
.for_each_with(sender, |s, i| {
let ind1 = i * 2;
let ind2 = ind1 + 1;
if phases[phase][ind1].1 >= phases[phase][ind2].1 {
s.send((i, phases[phase][ind1])).unwrap();
} else {
s.send((i, phases[phase][ind2])).unwrap();
}
});
for (i, child) in receiver {
phases[phase - 1][i] = child;
}
if phase > 1 {
Self::cup_phase_fight(phases, phase - 1);
}
}
}