-
Notifications
You must be signed in to change notification settings - Fork 0
/
bin packing.cpp
139 lines (136 loc) · 2 KB
/
bin packing.cpp
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
#include<iostream>
#include <windows.h>
#include<time.h>
#include<fstream>
using namespace std;
class Bin_packing
{
public:
int a[200];
int bestsize = 0;
int size = 0;
Bin_packing()
{
setarray();
buildrandomarray();
bestsize = countbin();
}
void setarray()
{
fstream f("BinTest.txt");
if (!f) {
cout << "Error opening file" << endl;
return;
}
int x = 0;
while (f >> x)
{
a[size]=x;
size++;
}
f.close();
}
int countbin()
{
int sum = 0;
int countbox = 0;
for (int i = 0; i < 200; i++)
{
sum += a[i];
if (sum <= 100000)
{
continue;
}
else
{
sum = a[i];
countbox++;
}
}
return countbox;
}
int randynum()
{
return rand() % (200);
}
void print()
{
int sum = 0;
int box = 1;
cout << "---------------------------" << box << endl;
box++;
for (int i = 0; i < 200; i++)
{
sum += a[i];
if (sum <= 100000)
{
cout << a[i] << endl;
}
else
{
cout << "---------------------------" <<box<< endl;
cout << a[i] << endl;
sum = a[i];
box++;
}
}
}
void buildrandomarray()
{
int b[200];
for (int i = 0; i < 200; i++)
{
b[i] = a[i];
a[i] = 0;
}
for (int q = 0; q < 200;)
{
int p = randynum();
if (b[p] != 0)
{
a[q] = b[p];
b[p] = 0;
q++;
}
}
}
};
int main()
{
srand(time(0));
int start_time = time(0);
Bin_packing bin;
int neighbor = 0;
int flat = 0;
while (true)
{
if (flat == 100000000)break;
int p = bin.randynum();
int q = bin.randynum();
if (p == q)continue;
int t1 = bin.a[p];
int t2 = bin.a[q];
bin.a[p] = t2;
bin.a[q] = t1;
neighbor = bin.countbin();
if (neighbor >bin.bestsize)
{
bin.a[p] = t1;
bin.a[q] = t2;
flat++;
continue;
}
else
{
if (neighbor != bin.bestsize)
{
cout <<"count box :" << bin.bestsize << " time :" << time(0) - start_time << endl;
flat = 0;
}
bin.bestsize = neighbor;
}
}
bin.print();
system("pause");
return 0;
}