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
|
// $Id: CbcHeuristicRENS.hpp 2105 2015-01-05 13:11:11Z forrest $
// Copyright (C) 2006, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
// edwin 12/5/09 carved out of CbcHeuristicRINS
#ifndef CbcHeuristicRENS_H
#define CbcHeuristicRENS_H
#include "CbcHeuristic.hpp"
/** LocalSearch class
*/
class CbcHeuristicRENS : public CbcHeuristic {
public:
// Default Constructor
CbcHeuristicRENS ();
/* Constructor with model - assumed before cuts
Initial version does not do Lps
*/
CbcHeuristicRENS (CbcModel & model);
// Copy constructor
CbcHeuristicRENS ( const CbcHeuristicRENS &);
// Destructor
~CbcHeuristicRENS ();
/// Clone
virtual CbcHeuristic * clone() const;
/// Assignment operator
CbcHeuristicRENS & operator=(const CbcHeuristicRENS& rhs);
/// Resets stuff if model changes
virtual void resetModel(CbcModel * model);
/// update model (This is needed if cliques update matrix etc)
virtual void setModel(CbcModel * model);
using CbcHeuristic::solution ;
/** returns 0 if no solution, 1 if valid solution.
Sets solution values if good, sets objective value (only if good)
This does Relaxation Extension Neighborhood Search
Does not run if when_<2 and a solution exists
*/
virtual int solution(double & objectiveValue,
double * newSolution);
/// Set type
inline void setRensType(int value)
{ rensType_ = value;}
protected:
// Data
/// Number of tries
int numberTries_;
/** Type
0 - fix at LB
1 - fix on dj
2 - fix at UB as well
3 - fix on 0.01*average dj
add 16 to allow two tries
32 - if solution exists use to keep more variables
64 - if priorities keep high priority
128 - if priorities keep low priority
*/
int rensType_;
};
#endif
|
