HEUR_NAME " heuristic"
113 intneighborhoodsize;
159 if(
REALABS(lpsol - mipsol) >= 0.5 )
167range = 2*lpsol-mipsol;
169 if( mipsol >= lpsol )
172*lbptr =
MAX(*lbptr, range);
183*ubptr =
MIN(*ubptr, range);
193*lbptr =
MAX(*lbptr, lbglobal);
194*ubptr =
MIN(*ubptr, ubglobal);
199*lbptr =
MAX(mipsol, lbglobal);
200*ubptr =
MIN(mipsol, ubglobal);
229assert(vars !=
NULL);
230assert(fixedvars !=
NULL);
231assert(fixedvals !=
NULL);
232assert(binfixings !=
NULL);
233assert(intfixings !=
NULL);
234assert(heur !=
NULL);
238assert(bestsol !=
NULL);
244checklength =
MIN(nsols, heurdata->solnum);
245assert(sols !=
NULL);
249 if( heurdata->deltalength < nbinvars )
254assert(newsize >= nbinvars);
259 for( i = heurdata->deltalength; i < newsize; i++ )
260heurdata->delta[i] =
TRUE;
262heurdata->deltalength = newsize;
265delta = heurdata->delta;
269*intfixings = *binfixings = 0;
270 for( i = 0; i < nbinvars; i++ )
287 if( nsols > 1 && heurdata->lastnsolsfound != nsolsfound && delta[i] )
290 for( j = 1; delta[i] && j < checklength &&
SCIPgetSolHeur(
scip, sols[j]) != heur ; j++ )
301fixedvars[nfixedvars] = vars[i];
302fixedvals[nfixedvars] = mipsolval;
308*binfixings = nfixedvars;
311heurdata->lastnsolsfound = nsolsfound;
314 for( i = nbinvars; i < nbinvars + nintvars; ++i )
323fixedvars[(nfixedvars)] = vars[i];
324fixedvals[(nfixedvars)] = lb;
329*intfixings = nfixedvars - *binfixings;
347 for( i = nbinvars; i < nbinvars + nintvars; ++i )
352 if( subvars[i] ==
NULL)
358 if( ub - lb >= 0.5 )
402assert(bestsol !=
NULL);
411rhs = (
SCIP_Real) heurdata->neighborhoodsize;
414 for( i = 0; i < nbinvars; i++ )
416 if( subvars[i] ==
NULL)
429consvals[nconsvars] = -1.0;
434consvals[nconsvars] = 1.0;
435consvars[nconsvars++] = subvars[i];
440lhs, rhs,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
FALSE,
FALSE,
TRUE,
TRUE,
FALSE) );
493heurdata->uselprows, heurdata->copycuts, &success,
NULL) );
497 if( eventhdlr ==
NULL)
503 SCIPdebugMsg(
scip,
"Copying the SCIP instance was %ssuccessful.\n", success ?
"":
"not ");
505 SCIPdebugMsg(
scip,
"DINS subproblem: %d vars (%d binvars & %d intvars), %d cons\n",
509 for( i = 0; i < nvars; i++ )
516 if( nbinvars - binfixings > heurdata->neighborhoodsize )
522 if( intfixings < nintvars )
524assert(nintvars > 0);
543heurdata->nodelimit = nsubnodes;
599cutoff =
MIN(upperbound, cutoff);
608cutoff =
MIN(upperbound, cutoff);
613 if( !heurdata->uselprows )
615assert(eventhdlr !=
NULL);
630 if( !heurdata->uselprows )
632assert(eventhdlr !=
NULL);
674assert(eventhdlr !=
NULL);
675assert(eventdata !=
NULL);
677assert(event !=
NULL);
681assert(heurdata !=
NULL);
703assert(heur !=
NULL);
718assert(heur !=
NULL);
723assert(heurdata !=
NULL);
740assert(heur !=
NULL);
745assert(heurdata !=
NULL);
748heurdata->usednodes = 0;
749heurdata->lastnsolsfound = 0;
755 if( heurdata->deltalength > 0 )
758 for( i = 0; i < heurdata->deltalength; i++ )
759heurdata->delta[i] =
TRUE;
770assert(heur !=
NULL);
775assert(heurdata !=
NULL);
778 if( heurdata->deltalength > 0 )
808assert(heur !=
NULL);
810assert(result !=
NULL);
816 if( nodeinfeasible )
833assert(heurdata !=
NULL);
849maxnnodes += heurdata->nodesofs;
852nsubnodes = maxnnodes - heurdata->usednodes;
853nsubnodes =
MIN(nsubnodes , heurdata->maxnodes);
856 if( nsubnodes < heurdata->minnodes )
864assert(nbinvars <= nvars);
867 if( nbinvars == 0 && nintvars == 0 )
877assert(vars !=
NULL);
883binfixings = intfixings = 0;
888 if( binfixings + intfixings == nbinvars + nintvars )
892 if( (binfixings + intfixings) / (
SCIP_Real)(
MAX(nbinvars + nintvars, 1)) < heurdata->minfixingrate )
900retcode =
wrapperDins(
scip, subscip, heur, heurdata, vars, fixedvars, fixedvals, result, nvars, nbinvars, nintvars, binfixings, intfixings, nsubnodes);
933assert(heur !=
NULL);
943 "number of nodes added to the contingent of the total nodes",
946 "contingent of sub problem nodes in relation to the number of nodes of the original problem",
949 "minimum number of nodes required to start the subproblem",
952 "number of pool-solutions to be checked for flag array update (for hard fixing of binary variables)",
955 "radius (using Manhattan metric) of the incumbent's neighborhood to be searched",
958 "maximum number of nodes to regard in the subproblem",
961 "factor by which " HEUR_NAME " should at least improve the incumbent",
964 "number of nodes without incumbent change that heuristic should wait",
968 "factor by which the limit on the number of LP depends on the node limit",
972 "minimum percentage of integer variables that have to be fixable",
976 "should subproblem be created out of the rows in the LP rows?",
980 "if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?",
984 "should uct node selection be used at the beginning of the search?",
988 "limit on number of improving incumbent solutions in sub-CIP",
Constraint handler for linear constraints in their most general form, .
#define SCIP_CALL_ABORT(x)
#define SCIP_LONGINT_FORMAT
SCIP_RETCODE SCIPcreateConsLinear(SCIP *scip, SCIP_CONS **cons, const char *name, int nvars, SCIP_VAR **vars, SCIP_Real *vals, SCIP_Real lhs, SCIP_Real rhs, SCIP_Bool initial, SCIP_Bool separate, SCIP_Bool enforce, SCIP_Bool check, SCIP_Bool propagate, SCIP_Bool local, SCIP_Bool modifiable, SCIP_Bool dynamic, SCIP_Bool removable, SCIP_Bool stickingatnode)
SCIP_RETCODE SCIPtranslateSubSols(SCIP *scip, SCIP *subscip, SCIP_HEUR *heur, SCIP_VAR **subvars, SCIP_Bool *success, int *solindex)
SCIP_RETCODE SCIPcheckCopyLimits(SCIP *sourcescip, SCIP_Bool *success)
SCIP_RETCODE SCIPcopyLimits(SCIP *sourcescip, SCIP *targetscip)
SCIP_Bool SCIPisStopped(SCIP *scip)
SCIP_RETCODE SCIPfree(SCIP **scip)
SCIP_RETCODE SCIPcreate(SCIP **scip)
int SCIPgetNIntVars(SCIP *scip)
const char * SCIPgetProbName(SCIP *scip)
SCIP_RETCODE SCIPsetObjlimit(SCIP *scip, SCIP_Real objlimit)
SCIP_RETCODE SCIPgetVarsData(SCIP *scip, SCIP_VAR ***vars, int *nvars, int *nbinvars, int *nintvars, int *nimplvars, int *ncontvars)
int SCIPgetNVars(SCIP *scip)
SCIP_RETCODE SCIPaddCons(SCIP *scip, SCIP_CONS *cons)
int SCIPgetNConss(SCIP *scip)
int SCIPgetNBinVars(SCIP *scip)
void SCIPhashmapFree(SCIP_HASHMAP **hashmap)
void * SCIPhashmapGetImage(SCIP_HASHMAP *hashmap, void *origin)
SCIP_RETCODE SCIPhashmapCreate(SCIP_HASHMAP **hashmap, BMS_BLKMEM *blkmem, int mapsize)
SCIP_RETCODE SCIPaddLongintParam(SCIP *scip, const char *name, const char *desc, SCIP_Longint *valueptr, SCIP_Bool isadvanced, SCIP_Longint defaultvalue, SCIP_Longint minvalue, SCIP_Longint maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_Bool SCIPisParamFixed(SCIP *scip, const char *name)
SCIP_RETCODE SCIPaddIntParam(SCIP *scip, const char *name, const char *desc, int *valueptr, SCIP_Bool isadvanced, int defaultvalue, int minvalue, int maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_RETCODE SCIPsetLongintParam(SCIP *scip, const char *name, SCIP_Longint value)
SCIP_RETCODE SCIPaddRealParam(SCIP *scip, const char *name, const char *desc, SCIP_Real *valueptr, SCIP_Bool isadvanced, SCIP_Real defaultvalue, SCIP_Real minvalue, SCIP_Real maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_RETCODE SCIPsetIntParam(SCIP *scip, const char *name, int value)
SCIP_RETCODE SCIPsetSubscipsOff(SCIP *scip, SCIP_Bool quiet)
SCIP_RETCODE SCIPsetPresolving(SCIP *scip, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_RETCODE SCIPsetCharParam(SCIP *scip, const char *name, char value)
SCIP_RETCODE SCIPaddBoolParam(SCIP *scip, const char *name, const char *desc, SCIP_Bool *valueptr, SCIP_Bool isadvanced, SCIP_Bool defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_RETCODE SCIPsetBoolParam(SCIP *scip, const char *name, SCIP_Bool value)
SCIP_RETCODE SCIPsetSeparating(SCIP *scip, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_RETCODE SCIPincludeHeurDins(SCIP *scip)
SCIP_BRANCHRULE * SCIPfindBranchrule(SCIP *scip, const char *name)
SCIP_RETCODE SCIPreleaseCons(SCIP *scip, SCIP_CONS **cons)
SCIP_RETCODE SCIPincludeEventhdlrBasic(SCIP *scip, SCIP_EVENTHDLR **eventhdlrptr, const char *name, const char *desc, SCIP_DECL_EVENTEXEC((*eventexec)), SCIP_EVENTHDLRDATA *eventhdlrdata)
const char * SCIPeventhdlrGetName(SCIP_EVENTHDLR *eventhdlr)
SCIP_EVENTTYPE SCIPeventGetType(SCIP_EVENT *event)
SCIP_RETCODE SCIPcatchEvent(SCIP *scip, SCIP_EVENTTYPE eventtype, SCIP_EVENTHDLR *eventhdlr, SCIP_EVENTDATA *eventdata, int *filterpos)
SCIP_RETCODE SCIPdropEvent(SCIP *scip, SCIP_EVENTTYPE eventtype, SCIP_EVENTHDLR *eventhdlr, SCIP_EVENTDATA *eventdata, int filterpos)
SCIP_RETCODE SCIPsetHeurExitsol(SCIP *scip, SCIP_HEUR *heur, SCIP_DECL_HEUREXITSOL((*heurexitsol)))
SCIP_RETCODE SCIPsetHeurCopy(SCIP *scip, SCIP_HEUR *heur, SCIP_DECL_HEURCOPY((*heurcopy)))
SCIP_HEURDATA * SCIPheurGetData(SCIP_HEUR *heur)
SCIP_RETCODE SCIPincludeHeurBasic(SCIP *scip, SCIP_HEUR **heur, const char *name, const char *desc, char dispchar, int priority, int freq, int freqofs, int maxdepth, SCIP_HEURTIMING timingmask, SCIP_Bool usessubscip, SCIP_DECL_HEUREXEC((*heurexec)), SCIP_HEURDATA *heurdata)
SCIP_RETCODE SCIPsetHeurFree(SCIP *scip, SCIP_HEUR *heur, SCIP_DECL_HEURFREE((*heurfree)))
SCIP_Longint SCIPheurGetNBestSolsFound(SCIP_HEUR *heur)
SCIP_Longint SCIPheurGetNCalls(SCIP_HEUR *heur)
SCIP_RETCODE SCIPsetHeurInitsol(SCIP *scip, SCIP_HEUR *heur, SCIP_DECL_HEURINITSOL((*heurinitsol)))
const char * SCIPheurGetName(SCIP_HEUR *heur)
void SCIPheurSetData(SCIP_HEUR *heur, SCIP_HEURDATA *heurdata)
SCIP_Bool SCIPhasCurrentNodeLP(SCIP *scip)
SCIP_LPSOLSTAT SCIPgetLPSolstat(SCIP *scip)
SCIP_Real SCIPgetLPObjval(SCIP *scip)
#define SCIPfreeBlockMemoryArray(scip, ptr, num)
int SCIPcalcMemGrowSize(SCIP *scip, int num)
#define SCIPallocBufferArray(scip, ptr, num)
#define SCIPfreeBufferArray(scip, ptr)
#define SCIPallocBlockMemoryArray(scip, ptr, num)
#define SCIPreallocBlockMemoryArray(scip, ptr, oldnum, newnum)
#define SCIPfreeBlockMemory(scip, ptr)
#define SCIPallocBlockMemory(scip, ptr)
SCIP_NODESEL * SCIPfindNodesel(SCIP *scip, const char *name)
SCIP_SOL * SCIPgetBestSol(SCIP *scip)
SCIP_HEUR * SCIPgetSolHeur(SCIP *scip, SCIP_SOL *sol)
int SCIPgetNSols(SCIP *scip)
SCIP_Longint SCIPgetSolNodenum(SCIP *scip, SCIP_SOL *sol)
SCIP_SOL ** SCIPgetSols(SCIP *scip)
SCIP_Real SCIPgetSolVal(SCIP *scip, SCIP_SOL *sol, SCIP_VAR *var)
SCIP_RETCODE SCIPtransformProb(SCIP *scip)
SCIP_RETCODE SCIPinterruptSolve(SCIP *scip)
SCIP_RETCODE SCIPsolve(SCIP *scip)
SCIP_Longint SCIPgetNSolsFound(SCIP *scip)
SCIP_Real SCIPgetUpperbound(SCIP *scip)
SCIP_Longint SCIPgetNNodes(SCIP *scip)
SCIP_RETCODE SCIPprintStatistics(SCIP *scip, FILE *file)
SCIP_Real SCIPgetLowerbound(SCIP *scip)
SCIP_Longint SCIPgetNLPs(SCIP *scip)
SCIP_Real SCIPgetCutoffbound(SCIP *scip)
SCIP_RETCODE SCIPcopyLargeNeighborhoodSearch(SCIP *sourcescip, SCIP *subscip, SCIP_HASHMAP *varmap, const char *suffix, SCIP_VAR **fixedvars, SCIP_Real *fixedvals, int nfixedvars, SCIP_Bool uselprows, SCIP_Bool copycuts, SCIP_Bool *success, SCIP_Bool *valid)
SCIP_Bool SCIPisGE(SCIP *scip, SCIP_Real val1, SCIP_Real val2)
SCIP_Bool SCIPisFeasEQ(SCIP *scip, SCIP_Real val1, SCIP_Real val2)
SCIP_Real SCIPfeasCeil(SCIP *scip, SCIP_Real val)
SCIP_Real SCIPfeasFloor(SCIP *scip, SCIP_Real val)
SCIP_Bool SCIPisInfinity(SCIP *scip, SCIP_Real val)
SCIP_Bool SCIPisFeasIntegral(SCIP *scip, SCIP_Real val)
SCIP_Real SCIPsumepsilon(SCIP *scip)
SCIP_VARTYPE SCIPvarGetType(SCIP_VAR *var)
SCIP_Real SCIPvarGetUbGlobal(SCIP_VAR *var)
SCIP_Real SCIPvarGetRootSol(SCIP_VAR *var)
SCIP_RETCODE SCIPchgVarLbGlobal(SCIP *scip, SCIP_VAR *var, SCIP_Real newbound)
SCIP_Real SCIPvarGetLPSol(SCIP_VAR *var)
SCIP_RETCODE SCIPchgVarUbGlobal(SCIP *scip, SCIP_VAR *var, SCIP_Real newbound)
SCIP_Real SCIPvarGetLbGlobal(SCIP_VAR *var)
int SCIPsnprintf(char *t, int len, const char *s,...)
#define DEFAULT_NODESQUOT
#define DEFAULT_NWAITINGNODES
static SCIP_DECL_EVENTEXEC(eventExecDins)
static SCIP_RETCODE determineVariableFixings(SCIP *scip, SCIP_HEUR *heur, SCIP_HEURDATA *heurdata, SCIP_VAR **vars, SCIP_VAR **fixedvars, SCIP_Real *fixedvals, int nbinvars, int nintvars, int *binfixings, int *intfixings)
static SCIP_DECL_HEUREXITSOL(heurExitsolDins)
#define DEFAULT_NEIGHBORHOODSIZE
#define DEFAULT_MINFIXINGRATE
#define DEFAULT_MINIMPROVE
#define DEFAULT_USELPROWS
#define DEFAULT_BESTSOLLIMIT
static SCIP_DECL_HEURCOPY(heurCopyDins)
static SCIP_DECL_HEURFREE(heurFreeDins)
static void computeIntegerVariableBounds(SCIP *scip, SCIP_VAR *var, SCIP_Real *lbptr, SCIP_Real *ubptr)
static SCIP_RETCODE addLocalBranchingConstraint(SCIP *scip, SCIP *subscip, SCIP_VAR **subvars, SCIP_HEURDATA *heurdata)
static SCIP_RETCODE reboundIntegerVariables(SCIP *scip, SCIP *subscip, SCIP_VAR **vars, SCIP_VAR **subvars, int nbinvars, int nintvars)
static SCIP_DECL_HEUREXEC(heurExecDins)
static SCIP_RETCODE wrapperDins(SCIP *scip, SCIP *subscip, SCIP_HEUR *heur, SCIP_HEURDATA *heurdata, SCIP_VAR **vars, SCIP_VAR **fixedvars, SCIP_Real *fixedvals, SCIP_RESULT *result, int nvars, int nbinvars, int nintvars, int binfixings, int intfixings, SCIP_Longint nsubnodes)
static SCIP_DECL_HEURINITSOL(heurInitsolDins)
methods commonly used by primal heuristics
memory allocation routines
BMS_BLKMEM * SCIPblkmem(SCIP *scip)
public methods for managing events
public methods for primal heuristics
public methods for message output
public data structures and miscellaneous methods
public methods for problem variables
public methods for branching rule plugins and branching
public methods for constraint handler plugins and constraints
public methods for problem copies
public methods for event handler plugins and event handlers
public methods for primal heuristic plugins and divesets
public methods for the LP relaxation, rows and columns
public methods for memory management
public methods for message handling
public methods for node selector plugins
public methods for numerical tolerances
public methods for SCIP parameter handling
public methods for global and local (sub)problems
public methods for solutions
public methods for querying solving statistics
public methods for SCIP variables
struct SCIP_EventData SCIP_EVENTDATA
#define SCIP_EVENTTYPE_LPSOLVED
struct SCIP_HeurData SCIP_HEURDATA
enum SCIP_Result SCIP_RESULT
enum SCIP_Retcode SCIP_RETCODE
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4