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
|
// $Id: CbcCompareUser.cpp 1898 2013-04-09 18:06:04Z stefan $
// Copyright (C) 2004, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
#include <cassert>
#include <cmath>
#include <cfloat>
//#define CBC_DEBUG
#include "CoinPragma.hpp"
#include "CbcMessage.hpp"
#include "CbcModel.hpp"
#include "CbcTree.hpp"
#include "CbcCompareUser.hpp"
#include "CoinError.hpp"
#include "CoinHelperFunctions.hpp"
/** Default Constructor
*/
CbcCompareUser::CbcCompareUser ()
: CbcCompareBase(),
weight_(-1.0),
saveWeight_(0.0),
numberSolutions_(0),
count_(0),
treeSize_(0)
{
test_=this;
}
// Constructor with weight
CbcCompareUser::CbcCompareUser (double weight)
: CbcCompareBase(),
weight_(weight) ,
saveWeight_(0.0),
numberSolutions_(0),
count_(0),
treeSize_(0)
{
test_=this;
}
// Copy constructor
CbcCompareUser::CbcCompareUser ( const CbcCompareUser & rhs)
:CbcCompareBase(rhs)
{
weight_=rhs.weight_;
saveWeight_ = rhs.saveWeight_;
numberSolutions_=rhs.numberSolutions_;
count_ = rhs.count_;
treeSize_ = rhs.treeSize_;
}
// Clone
CbcCompareBase *
CbcCompareUser::clone() const
{
return new CbcCompareUser(*this);
}
// Assignment operator
CbcCompareUser &
CbcCompareUser::operator=( const CbcCompareUser& rhs)
{
if (this!=&rhs) {
CbcCompareBase::operator=(rhs);
weight_=rhs.weight_;
saveWeight_ = rhs.saveWeight_;
numberSolutions_=rhs.numberSolutions_;
count_ = rhs.count_;
treeSize_ = rhs.treeSize_;
}
return *this;
}
// Destructor
CbcCompareUser::~CbcCompareUser ()
{
}
// For moment go to default
#if 0
// Returns true if y better than x
bool
CbcCompareUser::test (CbcNode * x, CbcNode * y)
{
if (x) {
if (y) {
if (weight_==-1.0) {
// before solution
/* printf("x %d %d %g, y %d %d %g\n",
x->numberUnsatisfied(),x->depth(),x->objectiveValue(),
y->numberUnsatisfied(),y->depth(),y->objectiveValue()); */
if (x->numberUnsatisfied() > y->numberUnsatisfied())
return true;
else if (x->numberUnsatisfied() < y->numberUnsatisfied())
return false;
else
return x->depth() < y->depth();
} else {
// after solution
double weight = CoinMax(weight_,0.0);
return x->objectiveValue()+ weight*x->numberUnsatisfied() >
y->objectiveValue() + weight*y->numberUnsatisfied();
//return x->guessedObjectiveValue()>y->guessedObjectiveValue();
}
} else {
return false;
}
} else {
return true;
}
}
// This allows method to change behavior as it is called
// after each solution
void
CbcCompareUser::newSolution(CbcModel * model,
double objectiveAtContinuous,
int numberInfeasibilitiesAtContinuous)
{
// set to get close to this solution
double costPerInteger =
(model->getObjValue()-objectiveAtContinuous)/
((double) numberInfeasibilitiesAtContinuous);
weight_ = 0.95*costPerInteger;
saveWeight_=weight_;
if (model->getSolutionCount()==model->getNumberHeuristicSolutions())
return; // solution was got by rounding
numberSolutions_++;
if (numberSolutions_>5)
weight_ =0.0; // this searches on objective
return (true) ;
}
// This allows method to change behavior
bool
CbcCompareUser::every1000Nodes(CbcModel * model, int numberNodes)
{
if (numberNodes>10000)
weight_ =0.0; // this searches on objective
else if (numberNodes==1000&&weight_==-2.0)
weight_=-1.0; // Go to depth first
// get size of tree
treeSize_ = model->tree()->size();
if (treeSize_>10000) {
// set weight to reduce size most of time
if (treeSize_>20000)
weight_=-1.0;
else if ((numberNodes%4000)!=0)
weight_=-1.0;
else
weight_=saveWeight_;
}
return numberNodes==11000; // resort if first time
}
// Returns true if wants code to do scan with alternate criterion
bool
CbcCompareUser::fullScan() const
{
count_++;
if (weight_)
return (count_%10)==0;
else
return false;
}
// This is alternate test function
bool
CbcCompareUser::alternateTest (CbcNode * x, CbcNode * y)
{
if (x) {
if (y) {
return x->objectiveValue() >
y->objectiveValue() ;
} else {
return false;
}
} else {
return true;
}
}
#else
// Returns true if y better than x
bool
CbcCompareUser::test (CbcNode * x, CbcNode * y)
{
if (weight_==-1.0&&(y->depth()>7||x->depth()>7)) {
// before solution
/* printf("x %d %d %g, y %d %d %g\n",
x->numberUnsatisfied(),x->depth(),x->objectiveValue(),
y->numberUnsatisfied(),y->depth(),y->objectiveValue()); */
if (x->numberUnsatisfied() > y->numberUnsatisfied()) {
return true;
} else if (x->numberUnsatisfied() < y->numberUnsatisfied()) {
return false;
} else {
int testX = x->depth();
int testY = y->depth();
if (testX!=testY)
return testX < testY;
else
return equalityTest(x,y); // so ties will be broken in consistent manner
}
} else {
// after solution
double weight = CoinMax(weight_,0.0);
double testX = x->objectiveValue()+ weight*x->numberUnsatisfied();
double testY = y->objectiveValue() + weight*y->numberUnsatisfied();
if (testX!=testY)
return testX > testY;
else
return equalityTest(x,y); // so ties will be broken in consistent manner
}
}
// This allows method to change behavior as it is called
// after each solution
bool
CbcCompareUser::newSolution(CbcModel * model,
double objectiveAtContinuous,
int numberInfeasibilitiesAtContinuous)
{
if (model->getSolutionCount()==model->getNumberHeuristicSolutions()&&
model->getSolutionCount()<5&&model->getNodeCount()<500)
return (false) ; // solution was got by rounding
// set to get close to this solution
double costPerInteger =
(model->getObjValue()-objectiveAtContinuous)/
((double) numberInfeasibilitiesAtContinuous);
weight_ = 0.95*costPerInteger;
saveWeight_ = 0.95*weight_;
numberSolutions_++;
if (numberSolutions_>5)
weight_ =0.0; // this searches on objective
return (true) ;
}
// This allows method to change behavior
bool
CbcCompareUser::every1000Nodes(CbcModel * model, int numberNodes)
{
double saveWeight=weight_;
int numberNodes1000 = numberNodes/1000;
if (numberNodes>10000) {
weight_ =0.0; // this searches on objective
// but try a bit of other stuff
if ((numberNodes1000%4)==1)
weight_=saveWeight_;
} else if (numberNodes==1000&&weight_==-2.0) {
weight_=-1.0; // Go to depth first
}
// get size of tree
treeSize_ = model->tree()->size();
if (treeSize_>10000) {
int n1 = model->solver()->getNumRows()+model->solver()->getNumCols();
int n2 = model->numberObjects();
double size = n1*0.1 + n2*2.0;
// set weight to reduce size most of time
if (treeSize_*size>5.0e7)
weight_=-1.0;
else if ((numberNodes1000%4)==0&&treeSize_*size>1.0e6)
weight_=-1.0;
else if ((numberNodes1000%4)==1)
weight_=0.0;
else
weight_=saveWeight_;
}
return (weight_!=saveWeight);
}
// Returns true if wants code to do scan with alternate criterion
bool
CbcCompareUser::fullScan() const
{
return false;
}
// This is alternate test function
bool
CbcCompareUser::alternateTest (CbcNode * x, CbcNode * y)
{
// not used
abort();
return false;
}
#endif
|
