forked from CorinnaKrebs/SolutionValidator
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTopOverhangingTest.cpp
More file actions
110 lines (95 loc) · 4.89 KB
/
TopOverhangingTest.cpp
File metadata and controls
110 lines (95 loc) · 4.89 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
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
#include "pch.h"
#include "CppUnitTest.h"
#include "../Validator/ConstraintsLoading.h"
#include <vector>
using namespace Microsoft::VisualStudio::CppUnitTestFramework;
using namespace validator;
namespace LoadingConstraints {
TEST_CLASS(TopOverhangingTest) {
double alpha = 0.75;
float dim = 4;
public:
TEST_METHOD(InfeasiblePosition) {
// 3rd Item is Overhanging, 4 Items in Stack
ItemType type(1, dim, dim, dim, 0, false, 0);
ItemType typeLong(1, 1.25 * dim, dim, dim, 0, false, 0);
Item item1(0, 1, 0, type);
Item item2(1, 1, 0, type);
Item item3(2, 1, 0, typeLong);
Item item4(3, 1, 0, type);
// Instance Creation
Customer customer(1, 0, 0, 4, 0, 0, 0, 0, 0);
std::vector<Customer> customers{ customer };
std::vector<ItemType> itemtypes{ type };
Instance instance("", Vehicle(0, 0, 0, 0, 0, 0, 0, 0, 0), itemtypes, customers, 0, 0);
instance.items.emplace_back(item1);
instance.items.emplace_back(item2);
instance.items.emplace_back(item3);
instance.items.emplace_back(item4);
// Tour Creation
std::vector<unsigned int> customer_ids{ 1 };
std::vector<unsigned int> item_ids{ 0, 1 , 2, 3};
Tour tour(1, customer_ids, item_ids);
// Positions
instance.items.at(item1.id).setPosition(Point(0, 0, 0));
instance.items.at(item2.id).setPosition(Point(0, 0, 1 * dim));
instance.items.at(item3.id).setPosition(Point(0, 0, 2 * dim));
instance.items.at(item4.id).setPosition(Point(0, 0, 3 * dim));
const unsigned int endPos = tour.item_ids.size();
ConstraintsLoading::getRelevantItems(instance.items.at(item1.id), tour, endPos, instance);
ConstraintsLoading::getRelevantItems(instance.items.at(item2.id), tour, endPos, instance);
ConstraintsLoading::getRelevantItems(instance.items.at(item3.id), tour, endPos, instance);
ConstraintsLoading::getRelevantItems(instance.items.at(item4.id), tour, endPos, instance);
// Tests
Assert::AreEqual(true, ConstraintsLoading::checkTopOverhanging(instance.items.at(item1.id), alpha, instance, true));
Assert::AreEqual(true, ConstraintsLoading::checkTopOverhanging(instance.items.at(item2.id), alpha, instance, true));
Assert::AreEqual(false, ConstraintsLoading::checkTopOverhanging(instance.items.at(item3.id), alpha, instance, true));
Assert::AreEqual(true, ConstraintsLoading::checkTopOverhanging(instance.items.at(item4.id), alpha, instance, true));
Assert::AreEqual(1.0, instance.items.at(item1.id).support);
Assert::AreEqual(1.0, instance.items.at(item2.id).support);
Assert::AreEqual(1.0, instance.items.at(item4.id).support);
Assert::IsTrue(instance.items.at(item3.id).support > alpha);
}
TEST_METHOD(FeasiblePosition) {
// Top Item (4th) is Overhanging
ItemType type(1, dim, dim, dim, 0, false, 0);
ItemType typeLong(1, 1.25 * dim, dim, dim, 0, false, 0);
Item item1(0, 1, 0, type);
Item item2(1, 1, 0, type);
Item item3(2, 1, 0, type);
Item item4(3, 1, 0, typeLong);
// Instance Creation
Customer customer(1, 0, 0, 4, 0, 0, 0, 0, 0);
std::vector<Customer> customers{ customer };
std::vector<ItemType> itemtypes{ type };
Instance instance("", Vehicle(0, 0, 0, 0, 0, 0, 0, 0, 0), itemtypes, customers, 0, 0);
instance.items.emplace_back(item1);
instance.items.emplace_back(item2);
instance.items.emplace_back(item3);
instance.items.emplace_back(item4);
// Tour Creation
std::vector<unsigned int> customer_ids{ 1 };
std::vector<unsigned int> item_ids{ 0, 1 , 2, 3 };
Tour tour(1, customer_ids, item_ids);
// Positions
instance.items.at(item1.id).setPosition(Point(0, 0, 0));
instance.items.at(item2.id).setPosition(Point(0, 0, 1 * dim));
instance.items.at(item3.id).setPosition(Point(0, 0, 2 * dim));
instance.items.at(item4.id).setPosition(Point(0, 0, 3 * dim));
const unsigned int endPos = tour.item_ids.size();
ConstraintsLoading::getRelevantItems(instance.items.at(item1.id), tour, endPos, instance);
ConstraintsLoading::getRelevantItems(instance.items.at(item2.id), tour, endPos, instance);
ConstraintsLoading::getRelevantItems(instance.items.at(item3.id), tour, endPos, instance);
ConstraintsLoading::getRelevantItems(instance.items.at(item4.id), tour, endPos, instance);
// Tests
Assert::AreEqual(true, ConstraintsLoading::checkTopOverhanging(instance.items.at(item1.id), alpha, instance, true));
Assert::AreEqual(true, ConstraintsLoading::checkTopOverhanging(instance.items.at(item2.id), alpha, instance, true));
Assert::AreEqual(true, ConstraintsLoading::checkTopOverhanging(instance.items.at(item3.id), alpha, instance, true));
Assert::AreEqual(true, ConstraintsLoading::checkTopOverhanging(instance.items.at(item4.id), alpha, instance, true));
Assert::AreEqual(1.0, instance.items.at(item1.id).support);
Assert::AreEqual(1.0, instance.items.at(item2.id).support);
Assert::AreEqual(1.0, instance.items.at(item3.id).support);
Assert::IsTrue(instance.items.at(item4.id).support > alpha);
}
};
}