-
Notifications
You must be signed in to change notification settings - Fork 0
/
Mutator.hpp
73 lines (68 loc) · 2.71 KB
/
Mutator.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
#if __APPLE__
#include "bits_stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include "Instance/Instance.hpp"
#include "Algorithms/CLK.hpp"
#include "Algorithms/Packer.hpp"
#include "Algorithms/Optimiser.hpp"
#include "Algorithms/ReOpter.hpp"
#include "Solver.hpp"
#include "Solvers/S1.hpp"
#include "Solvers/S2.hpp"
#include "Solvers/S4.hpp"
#include "Solvers/S6.hpp"
#include "Timer.hpp"
#include "Stats.hpp"
using namespace std;
class Mutator {
public:
Mutator(Instance _instance, Solution _sol) {
instance = _instance;
soln = _sol;
}
void dropAndCompute(Solver *solver, string mutation, double dropPercent, string reOpter, string tempFile = "temp.txt", int times = 1) {
Instance mutatedInstance = instance;
Solution sol = soln;
Solution reOptimisedSoln;
int t = times;
while (times--) {
if (mutation == "items") {
int k = dropPercent * instance.itemCount;
sol.dropKItems(mutatedInstance, k);
} else if (mutation == "cities") {
int k = dropPercent * instance.cityCount;
sol.dropKCities(mutatedInstance, k, "tempfiles/"+tempFile);
} else {
cout << "INVALID mutation" << endl;
return;
}
Experiment::startNewPhase();
Solution::evalCount = 0;
Experiment::addDataPoint(Solution::evalCount, sol.objective);
if (reOpter == "viaBitflip") { // reoptimised mutated
reOptimisedSoln = ReOpter::viaBitflip(mutatedInstance, sol);
} else if (reOpter == "viaPackIterative") { // from scratch
reOptimisedSoln = ReOpter::viaPackIterative(mutatedInstance, sol);
} else if (reOpter == "viaPackIterativeAndBitflip") { // from scratch
reOptimisedSoln = ReOpter::viaPackIterativeAndBitflip(mutatedInstance, sol);
} else if (reOpter == "viaStructuralDiversity") { // reoptimised mutated
reOptimisedSoln = ReOpter::viaStructuralDiversity(mutatedInstance, sol);
} else if (reOpter == "viaCLK") {
// fixed seed for linkern across multiple drops
reOptimisedSoln = ReOpter::viaCLK(mutatedInstance, sol, tempFile);
} else if (reOpter == "viaJump") {
reOptimisedSoln = ReOpter::viaJump(mutatedInstance, sol);
} else if (reOpter == "viaCLKAndJump") {
reOptimisedSoln = ReOpter::viaCLKAndJump(mutatedInstance, sol, tempFile);
} else {
cout << "INVALID reOpter" << endl;
return;
}
sol = reOptimisedSoln;
}
}
Instance instance;
Solution soln;
};