forked from google/or-tools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2d_orthogonal_packing_testing.cc
164 lines (155 loc) · 6.66 KB
/
2d_orthogonal_packing_testing.cc
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
// Copyright 2010-2024 Google LLC
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "ortools/sat/2d_orthogonal_packing_testing.h"
#include <algorithm>
#include <utility>
#include <vector>
#include "absl/log/check.h"
#include "absl/random/bit_gen_ref.h"
#include "absl/random/distributions.h"
#include "ortools/sat/diffn_util.h"
#include "ortools/sat/integer.h"
namespace operations_research {
namespace sat {
std::vector<Rectangle> GenerateNonConflictingRectangles(
int num_rectangles, absl::BitGenRef random) {
static constexpr int kSizeMax = 1'000'000;
std::vector<Rectangle> rectangles;
rectangles.reserve(num_rectangles);
rectangles.push_back(
{.x_min = 0, .x_max = kSizeMax, .y_min = 0, .y_max = kSizeMax});
for (int i = 0; i < num_rectangles; ++i) {
std::swap(rectangles.back(),
rectangles[absl::Uniform(random, 0ull, rectangles.size() - 1)]);
const Rectangle& rec = rectangles.back();
if (absl::Bernoulli(random, 0.5)) {
const IntegerValue cut = IntegerValue(
absl::Uniform(random, rec.x_min.value(), rec.x_max.value()));
const Rectangle new_range = {.x_min = rec.x_min,
.x_max = cut,
.y_min = rec.y_min,
.y_max = rec.y_max};
const Rectangle new_range2 = {.x_min = cut,
.x_max = rec.x_max,
.y_min = rec.y_min,
.y_max = rec.y_max};
rectangles.pop_back();
rectangles.push_back(new_range);
rectangles.push_back(new_range2);
} else {
const IntegerValue cut = IntegerValue(
absl::Uniform(random, rec.y_min.value(), rec.y_max.value()));
const Rectangle new_range = {.x_min = rec.x_min,
.x_max = rec.x_max,
.y_min = rec.y_min,
.y_max = cut};
const Rectangle new_range2 = {.x_min = rec.x_min,
.x_max = rec.x_max,
.y_min = cut,
.y_max = rec.y_max};
rectangles.pop_back();
rectangles.push_back(new_range);
rectangles.push_back(new_range2);
}
}
return rectangles;
}
std::vector<RectangleInRange> MakeItemsFromRectangles(
const std::vector<Rectangle>& rectangles, double slack_factor,
absl::BitGenRef random) {
IntegerValue size_max_x = 0;
IntegerValue size_max_y = 0;
for (const Rectangle& rec : rectangles) {
size_max_x = std::max(size_max_x, rec.SizeX());
size_max_y = std::max(size_max_y, rec.SizeY());
}
std::vector<RectangleInRange> ranges;
ranges.reserve(rectangles.size());
const int max_slack_x = slack_factor * size_max_x.value();
const int max_slack_y = slack_factor * size_max_y.value();
for (const Rectangle& rec : rectangles) {
RectangleInRange range;
range.x_size = rec.x_max - rec.x_min;
range.y_size = rec.y_max - rec.y_min;
range.bounding_area = {
.x_min =
rec.x_min - IntegerValue(absl::Uniform(random, 0, max_slack_x)),
.x_max =
rec.x_max + IntegerValue(absl::Uniform(random, 0, max_slack_x)),
.y_min =
rec.y_min - IntegerValue(absl::Uniform(random, 0, max_slack_y)),
.y_max =
rec.y_max + IntegerValue(absl::Uniform(random, 0, max_slack_y))};
ranges.push_back(range);
}
return ranges;
}
std::vector<ItemForPairwiseRestriction>
GenerateItemsRectanglesWithNoPairwiseConflict(
const std::vector<Rectangle>& rectangles, double slack_factor,
absl::BitGenRef random) {
const std::vector<RectangleInRange> range_items =
MakeItemsFromRectangles(rectangles, slack_factor, random);
std::vector<ItemForPairwiseRestriction> items;
items.reserve(rectangles.size());
for (int i = 0; i < range_items.size(); ++i) {
const RectangleInRange& rec = range_items[i];
items.push_back({.index = i,
.x = {.start_min = rec.bounding_area.x_min,
.start_max = rec.bounding_area.x_max - rec.x_size,
.end_min = rec.bounding_area.x_min + rec.x_size,
.end_max = rec.bounding_area.x_max},
.y = {.start_min = rec.bounding_area.y_min,
.start_max = rec.bounding_area.y_max - rec.y_size,
.end_min = rec.bounding_area.y_min + rec.y_size,
.end_max = rec.bounding_area.y_max}});
}
return items;
}
std::vector<ItemForPairwiseRestriction>
GenerateItemsRectanglesWithNoPairwisePropagation(int num_rectangles,
double slack_factor,
absl::BitGenRef random) {
const std::vector<Rectangle> rectangles =
GenerateNonConflictingRectangles(num_rectangles, random);
std::vector<ItemForPairwiseRestriction> items =
GenerateItemsRectanglesWithNoPairwiseConflict(rectangles, slack_factor,
random);
bool done = false;
// Now run the propagator until there is no more pairwise conditions.
do {
std::vector<PairwiseRestriction> results;
AppendPairwiseRestrictions(items, &results);
for (const PairwiseRestriction& restriction : results) {
CHECK(restriction.type !=
PairwiseRestriction::PairwiseRestrictionType::CONFLICT);
// Remove the slack we added
for (int index : {restriction.first_index, restriction.second_index}) {
const auto& rec = rectangles[index];
items[index] = {.index = index,
.x = {.start_min = rec.x_min,
.start_max = rec.x_min,
.end_min = rec.x_max,
.end_max = rec.x_max},
.y = {.start_min = rec.y_min,
.start_max = rec.y_min,
.end_min = rec.y_max,
.end_max = rec.y_max}};
}
}
done = results.empty();
} while (!done);
return items;
}
} // namespace sat
} // namespace operations_research