DINS primal heuristic (according to Ghosh)
Definition in file heur_dins.c.
#include "blockmemshell/memory.h"
#include "scip/cons_linear.h"
#include "scip/heur_dins.h"
#include "scip/heuristics.h"
#include "scip/pub_event.h"
#include "scip/pub_heur.h"
#include "scip/pub_message.h"
#include "scip/pub_misc.h"
#include "scip/pub_var.h"
#include "scip/scip_branch.h"
#include "scip/scip_cons.h"
#include "scip/scip_copy.h"
#include "scip/scip_event.h"
#include "scip/scip_general.h"
#include "scip/scip_heur.h"
#include "scip/scip_lp.h"
#include "scip/scip_mem.h"
#include "scip/scip_message.h"
#include "scip/scip_nodesel.h"
#include "scip/scip_numerics.h"
#include "scip/scip_param.h"
#include "scip/scip_prob.h"
#include "scip/scip_sol.h"
#include "scip/scip_solve.h"
#include "scip/scip_solvingstats.h"
#include "scip/scip_var.h"
#include <string.h>
Go to the source code of this file.
Macros | |
#define | HEUR_NAME "dins" |
#define | HEUR_DESC "distance induced neighborhood search by Ghosh" |
#define | HEUR_DISPCHAR SCIP_HEURDISPCHAR_LNS |
#define | HEUR_PRIORITY -1105000 |
#define | HEUR_FREQ -1 |
#define | HEUR_FREQOFS 0 |
#define | HEUR_MAXDEPTH -1 |
#define | HEUR_TIMING SCIP_HEURTIMING_AFTERLPNODE |
#define | HEUR_USESSUBSCIP TRUE |
#define | DEFAULT_NODESOFS 5000LL /* number of nodes added to the contingent of the total nodes */ |
#define | DEFAULT_MAXNODES 5000LL /* maximum number of nodes to regard in the subproblem */ |
#define | DEFAULT_MINNODES 50LL /* minimum number of nodes to regard in the subproblem */ |
#define | DEFAULT_MINIMPROVE 0.01 /* factor by which DINS should at least improve the incumbent */ |
#define | DEFAULT_NODESQUOT 0.05 /* subproblem nodes in relation to nodes of the original problem */ |
#define | DEFAULT_LPLIMFAC 1.5 /* factor by which the limit on the number of LP depends on the node limit */ |
#define | DEFAULT_MINFIXINGRATE 0.3 /* minimum percentage of integer variables that have to be fixed */ |
#define | DEFAULT_NWAITINGNODES 200LL /* number of nodes without incumbent change that heuristic should wait */ |
#define | DEFAULT_NEIGHBORHOODSIZE 18 /* radius of the incumbents neighborhood to be searched */ |
#define | DEFAULT_SOLNUM 5 /* number of pool-solutions to be checked for flag array update */ |
#define | DEFAULT_USELPROWS |
#define | DEFAULT_COPYCUTS |
#define | DEFAULT_BESTSOLLIMIT 3 /* limit on number of improving incumbent solutions in sub-CIP */ |
#define | DEFAULT_USEUCT FALSE /* should uct node selection be used at the beginning of the search? */ |
#define | EVENTHDLR_NAME "Dins" |
#define | EVENTHDLR_DESC "LP event handler for " HEUR_NAME " heuristic" |
#define HEUR_NAME "dins" |
Definition at line 62 of file heur_dins.c.
#define HEUR_DESC "distance induced neighborhood search by Ghosh" |
Definition at line 63 of file heur_dins.c.
#define HEUR_DISPCHAR SCIP_HEURDISPCHAR_LNS |
Definition at line 64 of file heur_dins.c.
#define HEUR_PRIORITY -1105000 |
Definition at line 65 of file heur_dins.c.
#define HEUR_FREQ -1 |
Definition at line 66 of file heur_dins.c.
#define HEUR_FREQOFS 0 |
Definition at line 67 of file heur_dins.c.
#define HEUR_MAXDEPTH -1 |
Definition at line 68 of file heur_dins.c.
#define HEUR_TIMING SCIP_HEURTIMING_AFTERLPNODE |
Definition at line 69 of file heur_dins.c.
#define HEUR_USESSUBSCIP TRUE |
does the heuristic use a secondary SCIP instance?
Definition at line 70 of file heur_dins.c.
#define DEFAULT_NODESOFS 5000LL /* number of nodes added to the contingent of the total nodes */ |
Definition at line 72 of file heur_dins.c.
#define DEFAULT_MAXNODES 5000LL /* maximum number of nodes to regard in the subproblem */ |
Definition at line 73 of file heur_dins.c.
#define DEFAULT_MINNODES 50LL /* minimum number of nodes to regard in the subproblem */ |
Definition at line 74 of file heur_dins.c.
#define DEFAULT_MINIMPROVE 0.01 /* factor by which DINS should at least improve the incumbent */ |
Definition at line 75 of file heur_dins.c.
#define DEFAULT_NODESQUOT 0.05 /* subproblem nodes in relation to nodes of the original problem */ |
Definition at line 76 of file heur_dins.c.
#define DEFAULT_LPLIMFAC 1.5 /* factor by which the limit on the number of LP depends on the node limit */ |
Definition at line 77 of file heur_dins.c.
#define DEFAULT_MINFIXINGRATE 0.3 /* minimum percentage of integer variables that have to be fixed */ |
Definition at line 78 of file heur_dins.c.
#define DEFAULT_NWAITINGNODES 200LL /* number of nodes without incumbent change that heuristic should wait */ |
Definition at line 79 of file heur_dins.c.
#define DEFAULT_NEIGHBORHOODSIZE 18 /* radius of the incumbents neighborhood to be searched */ |
Definition at line 80 of file heur_dins.c.
Referenced by SCIPincludeHeurDins(), SCIPincludeHeurFeaspump(), and SCIPincludeHeurLocalbranching().
Definition at line 81 of file heur_dins.c.
Referenced by SCIPincludeHeurDins().
#define DEFAULT_USELPROWS |
Definition at line 82 of file heur_dins.c.
#define DEFAULT_COPYCUTS |
Definition at line 83 of file heur_dins.c.
#define DEFAULT_BESTSOLLIMIT 3 /* limit on number of improving incumbent solutions in sub-CIP */ |
Definition at line 85 of file heur_dins.c.
#define DEFAULT_USEUCT FALSE /* should uct node selection be used at the beginning of the search? */ |
Definition at line 86 of file heur_dins.c.
#define EVENTHDLR_NAME "Dins" |
Definition at line 90 of file heur_dins.c.
#define EVENTHDLR_DESC "LP event handler for " HEUR_NAME " heuristic" |
Definition at line 91 of file heur_dins.c.
|
static |
compute tightened bounds for integer variables depending on how much the LP and the incumbent solution values differ
scip | SCIP data structure of the original problem |
var | the variable for which bounds should be computed |
lbptr | pointer to store the lower bound in the DINS sub-SCIP |
ubptr | pointer to store the upper bound in the DINS sub-SCIP |
Definition at line 130 of file heur_dins.c.
References assert(), MAX, MIN, REALABS, SCIP_Real, SCIP_VARTYPE_INTEGER, SCIPfeasCeil(), SCIPfeasFloor(), SCIPgetBestSol(), SCIPgetSolVal(), SCIPisFeasEQ(), SCIPvarGetLbGlobal(), SCIPvarGetLPSol(), SCIPvarGetType(), SCIPvarGetUbGlobal(), and var.
Referenced by determineVariableFixings(), and reboundIntegerVariables().
|
static |
creates a subproblem for subscip by fixing a number of variables
scip | SCIP data structure of the original problem |
heur | DINS heuristic structure |
heurdata | heuristic data structure |
vars | variables of the original problem |
fixedvars | array to store variables that should be fixed in the sub-SCIP |
fixedvals | array to store fixing values for fixed variables |
nbinvars | number of binary variables of problem and subproblem |
nintvars | number of general integer variables of problem and subproblem |
binfixings | pointer to store number of binary variables that should be fixed |
intfixings | pointer to store number of integer variables that should be fixed |
Definition at line 204 of file heur_dins.c.
References assert(), computeIntegerVariableBounds(), heurdata, i, MIN, nbinvars, nintvars, nsolsfound, NULL, SCIP_Bool, SCIP_CALL, SCIP_Longint, SCIP_OKAY, SCIP_Real, SCIPcalcMemGrowSize(), SCIPgetBestSol(), SCIPgetNSols(), SCIPgetNSolsFound(), SCIPgetSolHeur(), SCIPgetSols(), SCIPgetSolVal(), SCIPisFeasEQ(), SCIPreallocBlockMemoryArray, SCIPvarGetLPSol(), SCIPvarGetRootSol(), TRUE, and vars.
Referenced by SCIP_DECL_HEUREXEC().
|
static |
creates a subproblem for subscip by fixing a number of variables
scip | SCIP data structure of the original problem |
subscip | SCIP data structure of the subproblem |
vars | variables of the original problem |
subvars | variables of the DINS sub-SCIP |
nbinvars | number of binary variables of problem and subproblem |
nintvars | number of general integer variables of problem and subproblem |
Definition at line 334 of file heur_dins.c.
References assert(), computeIntegerVariableBounds(), i, nbinvars, nintvars, NULL, SCIP_CALL, SCIP_OKAY, SCIP_Real, SCIPchgVarLbGlobal(), SCIPchgVarUbGlobal(), SCIPisFeasEQ(), SCIPvarGetLbGlobal(), SCIPvarGetUbGlobal(), and vars.
Referenced by wrapperDins().
|
static |
create the extra constraint of local branching and add it to subscip
scip | SCIP data structure of the original problem |
subscip | SCIP data structure of the subproblem |
subvars | variables of the subproblem |
heurdata | heuristic's data structure |
Definition at line 372 of file heur_dins.c.
References assert(), FALSE, heurdata, i, nbinvars, NULL, SCIP_CALL, SCIP_MAXSTRLEN, SCIP_OKAY, SCIP_Real, SCIP_VARTYPE_BINARY, SCIPaddCons(), SCIPallocBufferArray, SCIPcreateConsLinear(), SCIPfreeBufferArray, SCIPgetBestSol(), SCIPgetProbName(), SCIPgetSolVal(), SCIPgetVarsData(), SCIPisFeasEQ(), SCIPisFeasIntegral(), SCIPreleaseCons(), SCIPsnprintf(), SCIPvarGetLbGlobal(), SCIPvarGetType(), SCIPvarGetUbGlobal(), TRUE, and vars.
Referenced by wrapperDins().
|
static |
Definition at line 668 of file heur_dins.c.
References assert(), EVENTHDLR_NAME, heurdata, NULL, SCIP_CALL, SCIP_EVENTTYPE_LPSOLVED, SCIP_LONGINT_FORMAT, SCIP_OKAY, SCIPdebugMsg, SCIPeventGetType(), SCIPeventhdlrGetName(), SCIPgetNLPs(), and SCIPinterruptSolve().
|
static |
wrapper for the part of heuristic that runs a subscip. Wrapper is needed to avoid possible ressource leaks
scip | original SCIP data structure |
subscip | SCIP structure of the subproblem |
heur | Heuristic pointer |
heurdata | Heuristic's data |
vars | original problem's variables |
fixedvars | Fixed variables of original SCIP |
fixedvals | Fixed values of original SCIP |
result | Result pointer |
nvars | Number of variables |
nbinvars | Number of binary variables in original SCIP |
nintvars | Number of integer variables in original SCIP |
binfixings | Number of binary fixing in original SCIP |
intfixings | Number of integer fixings in original SCIP |
nsubnodes | Number of nodes in the subscip |
Definition at line 454 of file heur_dins.c.
References addLocalBranchingConstraint(), assert(), cutoff, EVENTHDLR_DESC, EVENTHDLR_NAME, FALSE, HEUR_NAME, heurdata, i, MAX, MIN, nbinvars, nintvars, NULL, nvars, reboundIntegerVariables(), result, SCIP_Bool, SCIP_CALL, SCIP_CALL_ABORT, SCIP_EVENTTYPE_LPSOLVED, SCIP_FOUNDSOL, SCIP_Longint, SCIP_LONGINT_FORMAT, SCIP_OKAY, SCIP_PARAMSETTING_FAST, SCIP_PARAMSETTING_OFF, SCIP_PLUGINNOTFOUND, SCIP_Real, SCIPallocBufferArray, SCIPblkmem(), SCIPcatchEvent(), SCIPcopyLargeNeighborhoodSearch(), SCIPcopyLimits(), SCIPdebug, SCIPdebugMsg, SCIPdropEvent(), SCIPerrorMessage, SCIPfindBranchrule(), SCIPfindNodesel(), SCIPfreeBufferArray, SCIPgetLowerbound(), SCIPgetNBinVars(), SCIPgetNConss(), SCIPgetNIntVars(), SCIPgetNNodes(), SCIPgetNSols(), SCIPgetNVars(), SCIPgetUpperbound(), SCIPhashmapCreate(), SCIPhashmapFree(), SCIPhashmapGetImage(), SCIPincludeEventhdlrBasic(), SCIPisInfinity(), SCIPisParamFixed(), SCIPprintStatistics(), SCIPsetBoolParam(), SCIPsetCharParam(), SCIPsetIntParam(), SCIPsetLongintParam(), SCIPsetObjlimit(), SCIPsetPresolving(), SCIPsetSeparating(), SCIPsetSubscipsOff(), SCIPsolve(), SCIPsumepsilon(), SCIPtransformProb(), SCIPtranslateSubSols(), TRUE, and vars.
Referenced by SCIP_DECL_HEUREXEC().
|
static |
copy method for primal heuristic plugins (called when SCIP copies plugins)
Definition at line 698 of file heur_dins.c.
References assert(), HEUR_NAME, NULL, SCIP_CALL, SCIP_OKAY, SCIPheurGetName(), and SCIPincludeHeurDins().
|
static |
destructor of primal heuristic to free user data (called when SCIP is exiting)
Definition at line 712 of file heur_dins.c.
References assert(), heurdata, NULL, SCIP_OKAY, SCIPfreeBlockMemory, SCIPheurGetData(), and SCIPheurSetData().
|
static |
solving process initialization method of primal heuristic (called when branch and bound process is about to begin)
Definition at line 733 of file heur_dins.c.
References assert(), heurdata, i, NULL, SCIP_CALL, SCIP_OKAY, SCIPallocBlockMemoryArray, SCIPgetNBinVars(), SCIPheurGetData(), and TRUE.
|
static |
solving process deinitialization method of primal heuristic (called before branch and bound process data is freed)
Definition at line 764 of file heur_dins.c.
References assert(), heurdata, NULL, SCIP_OKAY, SCIPfreeBlockMemoryArray, and SCIPheurGetData().
|
static |
execution method of primal heuristic
Definition at line 785 of file heur_dins.c.
References assert(), determineVariableFixings(), heurdata, MAX, MIN, nbinvars, nintvars, NULL, nvars, result, SCIP_Bool, SCIP_CALL, SCIP_DELAYED, SCIP_DIDNOTFIND, SCIP_DIDNOTRUN, SCIP_Longint, SCIP_LPSOLSTAT_OPTIMAL, SCIP_OKAY, SCIP_Real, SCIPallocBufferArray, SCIPcheckCopyLimits(), SCIPcreate(), SCIPfree(), SCIPfreeBufferArray, SCIPgetBestSol(), SCIPgetCutoffbound(), SCIPgetLPObjval(), SCIPgetLPSolstat(), SCIPgetNNodes(), SCIPgetNSols(), SCIPgetSolNodenum(), SCIPgetVarsData(), SCIPhasCurrentNodeLP(), SCIPheurGetData(), SCIPheurGetNBestSolsFound(), SCIPheurGetNCalls(), SCIPisGE(), SCIPisStopped(), vars, and wrapperDins().