-
Notifications
You must be signed in to change notification settings - Fork 2
/
quadratic_multiple_knapsack.hpp
405 lines (349 loc) · 11.6 KB
/
quadratic_multiple_knapsack.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
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
/**
* Quadratic multiple knapsack problem
*
* Input:
* - m containers (knapsacks); for each knapsack i = 1..m, a capacity cᵢ
* - n items; for each item j = 1..n, a profit pⱼ and a weight wⱼ
* - for all pairs of items (j₁, j₂) with j₁ ≠ j₂, a profit pⱼ₁ⱼ₂
* Problem:
* - select m disjoint subsets of items (one per knapsack) such that the total
* weight of the items in a knapsack does not exceed its capacity
* Objective:
* - Maximize the overall profit of the knapsacks.
* The profit of a knapsack is the sum of the profits of the items and profit
* of the pairs of items it contains.
*
*/
#pragma once
#include "optimizationtools/containers/indexed_set.hpp"
#include <fstream>
#include <iostream>
#include <iomanip>
namespace orproblems
{
namespace quadratic_multiple_knapsack
{
using ItemId = int64_t;
using ItemPos = int64_t;
using KnapsackId = int64_t;
using Weight = int64_t;
using Profit = int64_t;
/**
* Instance class for a 'quadratic_multiple_knapsack' problem.
*/
class Instance
{
public:
/*
* Getters
*/
/** Get the number of knapsacks. */
KnapsackId number_of_knapsacks() const { return capacities_.size(); }
/** Get the number of items. */
ItemId number_of_items() const { return weights_.size(); }
/** Get the weight of an item. */
Weight weight(ItemId item_id) const { return weights_[item_id]; }
/** Get the profit of an item. */
Profit profit(ItemId item_id) const { return profits_[item_id][item_id]; }
/** Get the profit of two items. */
Profit profit(
ItemId item_id_1,
ItemId item_id_2) const
{
return profits_[std::min(item_id_1, item_id_2)][std::max(item_id_1, item_id_2)];
}
/** Get the capacity of a knapsack. */
Weight capacity(KnapsackId knapsack_id) const { return capacities_[knapsack_id]; }
/*
* Outputs
*/
/** Print the instance. */
void format(
std::ostream& os,
int verbosity_level = 1) const
{
if (verbosity_level >= 1) {
os
<< "Number of knapsacks: " << number_of_knapsacks() << std::endl
<< "Number of items: " << number_of_items() << std::endl
;
}
if (verbosity_level >= 2) {
os << std::endl
<< std::setw(12) << "Knapsack"
<< std::setw(12) << "Capacity"
<< std::endl
<< std::setw(12) << "--------"
<< std::setw(12) << "--------"
<< std::endl;
for (KnapsackId knapsack_id = 0;
knapsack_id < number_of_knapsacks();
knapsack_id++) {
os
<< std::setw(12) << knapsack_id
<< std::setw(12) << capacity(knapsack_id)
<< std::endl;
}
}
if (verbosity_level >= 2) {
os << std::endl
<< std::setw(12) << "Item"
<< std::setw(12) << "Weight"
<< std::setw(12) << "Profit"
<< std::endl
<< std::setw(12) << "----"
<< std::setw(12) << "------"
<< std::setw(12) << "------"
<< std::endl;
for (ItemId item_id = 0;
item_id < number_of_items();
++item_id) {
os
<< std::setw(12) << item_id
<< std::setw(12) << weight(item_id)
<< std::setw(12) << profit(item_id)
<< std::endl;
}
}
if (verbosity_level >= 2) {
os << std::endl
<< std::setw(12) << "Item 1"
<< std::setw(12) << "Item 2"
<< std::setw(12) << "Profit"
<< std::endl
<< std::setw(12) << "------"
<< std::setw(12) << "------"
<< std::setw(12) << "------"
<< std::endl;
for (ItemId item_id_1 = 0;
item_id_1 < number_of_items();
++item_id_1) {
for (ItemId item_id_2 = 0;
item_id_2 < number_of_items();
++item_id_2) {
os
<< std::setw(12) << item_id_1
<< std::setw(12) << item_id_2
<< std::setw(12) << profit(item_id_1, item_id_2)
<< std::endl;
}
}
}
}
/** Check a certificate. */
std::pair<bool, Profit> check(
const std::string& certificate_path,
std::ostream& os,
int verbosity_level = 1) const
{
std::ifstream file(certificate_path);
if (!file.good()) {
throw std::runtime_error(
"Unable to open file \"" + certificate_path + "\".");
}
if (verbosity_level >= 2) {
os << std::endl
<< std::setw(12) << "Knapsack"
<< std::setw(12) << "Item"
<< std::setw(12) << "Weight"
<< std::setw(12) << "Profit"
<< std::endl
<< std::setw(12) << "--------"
<< std::setw(12) << "----"
<< std::setw(12) << "------"
<< std::setw(12) << "------"
<< std::endl;
}
Weight overweight = 0;
Profit total_profit = 0;
ItemId number_of_items = -1;
ItemId item_id = -1;
optimizationtools::IndexedSet items(this->number_of_items());
ItemPos number_of_duplicates = 0;
for (KnapsackId knapsack_id = 0;
knapsack_id < number_of_knapsacks();
++knapsack_id) {
Weight total_weight = 0;
file >> number_of_items;
std::vector<ItemId> current_knapsack_items;
for (ItemPos item_pos = 0; item_pos < number_of_items; ++item_pos) {
file >> item_id;
current_knapsack_items.push_back(item_id);
total_weight += weight(item_id);
for (ItemId j2: current_knapsack_items)
total_profit += profit(item_id, j2);
if (verbosity_level >= 2) {
os
<< std::setw(12) << knapsack_id
<< std::setw(12) << item_id
<< std::setw(12) << total_weight
<< std::setw(12) << total_profit
<< std::endl;
}
// Check duplicates.
if (items.contains(item_id)) {
number_of_duplicates++;
if (verbosity_level >= 2) {
os << "Item " << item_id
<< " has already been packed." << std::endl;
}
}
items.add(item_id);
}
if (total_weight > capacity(knapsack_id)) {
if (verbosity_level >= 2) {
os << "Knapsack " << knapsack_id
<< " has overweight: " << total_weight
<< "/" << capacity(knapsack_id)
<< std::endl;
}
overweight += (capacity(knapsack_id) - total_weight);
}
}
bool feasible
= (number_of_duplicates == 0)
&& (overweight == 0);
if (verbosity_level >= 2)
os << std::endl;
if (verbosity_level >= 1) {
os
<< "Number of items: " << items.size() << " / " << this->number_of_items() << std::endl
<< "Number of duplicates: " << number_of_duplicates << std::endl
<< "Overweight: " << overweight << std::endl
<< "Feasible: " << feasible << std::endl
<< "Profit: " << total_profit << std::endl
;
}
return {feasible, total_profit};
}
private:
/*
* Private methods
*/
/** Constructor to build an instance manually. */
Instance() { }
/*
* Private attributes
*/
/** Weights. */
std::vector<Weight> weights_;
/** Profits. */
std::vector<std::vector<Profit>> profits_;
/** Capacities. */
std::vector<Weight> capacities_;
friend class InstanceBuilder;
};
class InstanceBuilder
{
public:
/** Constructor. */
InstanceBuilder() { }
/** Add a knapsack. */
void add_knapsack(Weight capacity)
{
instance_.capacities_.push_back(capacity);
}
/** Add an item. */
void add_item(Weight weight)
{
instance_.weights_.push_back(weight);
instance_.profits_.push_back(std::vector<Profit>(instance_.weights_.size()));
}
/** Set the weight of an item. */
void set_weight(
ItemId item_id,
Weight weight)
{
instance_.weights_[item_id] = weight;
}
/** Set the profit of an item. */
void set_profit(
ItemId item_id,
Profit profit)
{
instance_.profits_[item_id][item_id] = profit;
}
/** Set the profit of packing two items. */
void set_profit(
ItemId item_id_1,
ItemId item_id_2,
Profit profit)
{
instance_.profits_[std::min(item_id_1, item_id_2)][std::max(item_id_1, item_id_2)] = profit;
}
/** Build an instance from a file. */
void read(
const std::string& instance_path,
const std::string& format = "")
{
std::ifstream file(instance_path);
if (!file.good())
throw std::runtime_error(
"Unable to open file \"" + instance_path + "\".");
if (format == "" || format == "hiley2006") {
read_hiley2006(file);
} else {
throw std::invalid_argument(
"Unknown instance format \"" + format + "\".");
}
file.close();
}
/*
* Build
*/
/** Build the instance. */
Instance build()
{
return std::move(instance_);
}
private:
/*
* Private methods
*/
/** Read an instance from a file in 'hiley2006' format. */
void read_hiley2006(std::ifstream& file)
{
std::string tmp;
file >> tmp;
KnapsackId number_of_knapsacks;
ItemId number_of_items;
file >> number_of_knapsacks >> number_of_items;
for (ItemId item_id = 0; item_id < number_of_items; ++item_id)
add_item(0);
Profit profit;
for (ItemId item_id = 0; item_id < number_of_items; ++item_id) {
file >> profit;
set_profit(item_id, profit);
}
for (ItemId item_id_1 = 0;
item_id_1 < number_of_items;
++item_id_1) {
for (ItemId item_id_2 = item_id_1 + 1;
item_id_2 < number_of_items;
++item_id_2) {
file >> profit;
set_profit(item_id_1, item_id_2, profit);
}
}
Weight capacity = -1;
file >> capacity;
file >> capacity;
for (KnapsackId knapsack_id = 0;
knapsack_id < number_of_knapsacks;
++knapsack_id) {
add_knapsack(capacity);
}
Weight weight = -1;
for (ItemId item_id = 0; item_id < number_of_items; ++item_id) {
file >> weight;
set_weight(item_id, weight);
}
}
/*
* Private attributes
*/
/** Instance. */
Instance instance_;
};
}
}