-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathSelection.hpp
252 lines (213 loc) · 6.03 KB
/
Selection.hpp
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
//
// Selection.hpp
// NSGA-Parallel-Backend
//
// Created by a1091793 on 23/11/2015.
//
//
#ifndef Selection_h
#define Selection_h
#include <algorithm>
#include <chrono>
#include <random>
#include "Comparator.hpp"
#include "Population.hpp"
template <typename RNG = std::mt19937>
class TournamentSelection
{
private:
std::uniform_real_distribution<double> sel_uniform;
unsigned seed_selection;
RNG default_rng_selection;
RNG & random_number_gen;
IndividualSPtr
tournament(IndividualSPtr ind1, IndividualSPtr ind2)
{
int flag;
flag = Comparator::whichDominates(ind1, ind2);
if (flag==1)
{
return (ind1);
}
if (flag==2)
{
return (ind2);
}
if (ind1->getCrowdingScore() > ind2->getCrowdingScore())
{
return(ind1);
}
if (ind2->getCrowdingScore() > ind1->getCrowdingScore())
{
return(ind2);
}
if ( sel_uniform(random_number_gen) <= 0.5)
{
return(ind1);
}
else
{
return(ind2);
}
}
public:
TournamentSelection()
:
sel_uniform(0.0,1.0),
seed_selection(std::chrono::system_clock::now().time_since_epoch().count()),
default_rng_selection(seed_selection),
random_number_gen(default_rng_selection)
{
}
TournamentSelection(RNG & rng)
:
sel_uniform(0.0,1.0),
seed_selection(std::chrono::system_clock::now().time_since_epoch().count()),
default_rng_selection(seed_selection),
random_number_gen(rng)
{
}
PopulationSPtr
operator()(PopulationSPtr parent_pop)
{
std::vector<IndividualSPtr> a1, a2;
for (int i = 0; i < parent_pop->populationSize(); ++i)
{
a1.push_back((*parent_pop)[i]);
a2.push_back((*parent_pop)[i]);
}
std::shuffle(a2.begin(), a2.end(), random_number_gen);
//Possible for a1[i] and a2[i] to be same indiviudal.
PopulationSPtr child_pop(new Population);
for (int i = 0; i < parent_pop->populationSize(); ++i)
{
child_pop->push_back(IndividualSPtr( new Individual(*(tournament(a1[i], a2[i])))));
}
return (child_pop);
}
};
template <typename RNG = std::mt19937>
class TournamentSelectionContinuousEvolution
{
private:
std::uniform_real_distribution<double> sel_uniform;
unsigned seed_selection;
RNG default_rng_selection;
RNG & random_number_gen;
std::vector<IndividualSPtr> a1, a2;
int pos;
bool only_add_nondom_2_breed_pop;
IndividualSPtr
tournament(IndividualSPtr ind1, IndividualSPtr ind2)
{
int flag;
flag = Comparator::whichDominates(ind1, ind2);
if (flag==1)
{
return (ind1);
}
if (flag==2)
{
return (ind2);
}
if (ind1->getCrowdingScore() > ind2->getCrowdingScore())
{
return(ind1);
}
if (ind2->getCrowdingScore() > ind1->getCrowdingScore())
{
return(ind2);
}
if ( sel_uniform(random_number_gen) <= 0.5)
{
return(ind1);
}
else
{
return(ind2);
}
}
void
resortBreedingPop()
{
std::shuffle(a1.begin(), a1.end(), random_number_gen);
pos = 0;
}
public:
TournamentSelectionContinuousEvolution()
:
sel_uniform(0.0,1.0),
seed_selection(std::chrono::system_clock::now().time_since_epoch().count()),
default_rng_selection(seed_selection),
random_number_gen(default_rng_selection),
pos(0),
only_add_nondom_2_breed_pop(true)
{
}
TournamentSelectionContinuousEvolution(RNG & rng)
:
sel_uniform(0.0,1.0),
seed_selection(std::chrono::system_clock::now().time_since_epoch().count()),
default_rng_selection(seed_selection),
random_number_gen(rng),
pos(0),
only_add_nondom_2_breed_pop(true)
{
}
void
resetBreedingPop(PopulationSPtr pop)
{
a1.clear();
for (int i = 0; i < pop->populationSize(); ++i)
{
a1.push_back((*pop)[i]);
}
std::shuffle(a1.begin(), a1.end(), random_number_gen);
pos = 0;
}
void
add2BreedingPop(IndividualSPtr new_ind)
{
if (only_add_nondom_2_breed_pop)
{
//Test whether nondominated.
for(IndividualSPtr current_ind: a1)
{
if (Comparator::whichDominates(new_ind, current_ind) == 1)
{
//Then we add. then return.
std::uniform_int_distribution<int> uid(0, a1.size());
int loc = uid(random_number_gen);
std::vector<IndividualSPtr>::iterator insert_it = a1.begin() + loc;
a1.insert(insert_it, new_ind);
if (pos <= loc) ++pos;
return;
}
}
}
else
{
std::uniform_int_distribution<int> uid(0, a1.size());
int loc = uid(random_number_gen);
std::vector<IndividualSPtr>::iterator insert_it = a1.begin() + loc;
a1.insert(insert_it, new_ind);
if (pos <= loc) ++pos;
return;
}
}
PopulationSPtr
operator()(int number_selected)
{
PopulationSPtr selected_pop(new Population);
for (int i = 0; i < number_selected; ++i)
{
if (pos >= a1.size()) {resortBreedingPop(); pos = 0;}
IndividualSPtr ind1 = a1[pos++];
if (pos >= a1.size()) {resortBreedingPop(); pos = 0;}
IndividualSPtr ind2 = a1[pos++];
selected_pop->push_back(IndividualSPtr(new Individual(*(tournament(ind1, ind2)))));
}
return (selected_pop);
}
};
#endif /* Selection_h */