Parameters with prefix heuristics/alns. More...

Namespaces
namespace	CROSSOVER
	Parameters with prefix heuristics/alns/crossover.

namespace	DINS
	Parameters with prefix heuristics/alns/dins.

namespace	LOCALBRANCHING
	Parameters with prefix heuristics/alns/localbranching.

namespace	MUTATION
	Parameters with prefix heuristics/alns/mutation.

namespace	PROXIMITY
	Parameters with prefix heuristics/alns/proximity.

namespace	RENS
	Parameters with prefix heuristics/alns/rens.

namespace	RINS
	Parameters with prefix heuristics/alns/rins.

namespace	TRUSTREGION
	Parameters with prefix heuristics/alns/trustregion.

namespace	ZEROOBJECTIVE
	Parameters with prefix heuristics/alns/zeroobjective.

Variables
constexpr Param< bool >	ADJUSTFIXINGRATE { "heuristics/alns/adjustfixingrate" }
	should the heuristic adjust the target fixing rate based on the success?

constexpr Param< bool >	ADJUSTMINIMPROVE { "heuristics/alns/adjustminimprove" }
	should the factor by which the minimum improvement is bound be dynamically updated?

constexpr Param< bool >	ADJUSTTARGETNODES { "heuristics/alns/adjusttargetnodes" }
	should the target nodes be dynamically adjusted?

constexpr Param< double >	ALPHA { "heuristics/alns/alpha" }
	parameter to increase the confidence width in UCB

constexpr Param< char >	BANDITALGO { "heuristics/alns/banditalgo" }
	the bandit algorithm: (u)pper confidence bounds, (e)xp.3, epsilon (g)reedy

constexpr Param< double >	BETA { "heuristics/alns/beta" }
	reward offset between 0 and 1 at every observation for Exp.3

constexpr Param< bool >	COPYCUTS { "heuristics/alns/copycuts" }
	should cutting planes be copied to the sub-SCIP?

constexpr Param< bool >	DOMOREFIXINGS { "heuristics/alns/domorefixings" }
	should the ALNS heuristic do more fixings by itself based on variable prioritization until the target fixing rate is reached?

constexpr Param< double >	EPS { "heuristics/alns/eps" }
	increase exploration in epsilon-greedy bandit algorithm

constexpr Param< double >	FIXTOL { "heuristics/alns/fixtol" }
	tolerance by which the fixing rate may be missed without generic fixing

constexpr Param< int >	FREQ { "heuristics/alns/freq" }
	frequency for calling primal heuristic <alns> (-1: never, 0: only at depth freqofs)

constexpr Param< int >	FREQOFS { "heuristics/alns/freqofs" }
	frequency offset for calling primal heuristic <alns>

constexpr Param< double >	GAMMA { "heuristics/alns/gamma" }
	weight between uniform (gamma ~ 1) and weight driven (gamma ~ 0) probability distribution for exp3

constexpr Param< bool >	INITDURINGROOT { "heuristics/alns/initduringroot" }
	should the heuristic be executed multiple times during the root node?

constexpr Param< int >	MAXCALLSSAMESOL { "heuristics/alns/maxcallssamesol" }
	number of allowed executions of the heuristic on the same incumbent solution (-1: no limit, 0: number of active neighborhoods)

constexpr Param< int >	MAXDEPTH { "heuristics/alns/maxdepth" }
	maximal depth level to call primal heuristic <alns> (-1: no limit)

constexpr Param< long long >	MAXNODES { "heuristics/alns/maxnodes" }
	maximum number of nodes to regard in the subproblem

constexpr Param< double >	MINIMPROVEHIGH { "heuristics/alns/minimprovehigh" }
	upper bound for the minimal improvement over the incumbent

constexpr Param< double >	MINIMPROVELOW { "heuristics/alns/minimprovelow" }
	lower threshold for the minimal improvement over the incumbent

constexpr Param< long long >	MINNODES { "heuristics/alns/minnodes" }
	minimum number of nodes required to start a sub-SCIP

constexpr Param< long long >	NODESOFS { "heuristics/alns/nodesofs" }
	offset added to the nodes budget

constexpr Param< double >	NODESQUOT { "heuristics/alns/nodesquot" }
	fraction of nodes compared to the main SCIP for budget computation

constexpr Param< double >	NODESQUOTMIN { "heuristics/alns/nodesquotmin" }
	lower bound fraction of nodes compared to the main SCIP for budget computation

constexpr Param< int >	NSOLSLIM { "heuristics/alns/nsolslim" }
	limit on the number of improving solutions in a sub-SCIP call

constexpr Param< int >	PRIORITY { "heuristics/alns/priority" }
	priority of heuristic <alns>

constexpr Param< bool >	RESETWEIGHTS { "heuristics/alns/resetweights" }
	should the bandit algorithms be reset when a new problem is read?

constexpr Param< double >	REWARDBASELINE { "heuristics/alns/rewardbaseline" }
	the reward baseline to separate successful and failed calls

constexpr Param< double >	REWARDCONTROL { "heuristics/alns/rewardcontrol" }
	reward control to increase the weight of the simple solution indicator and decrease the weight of the closed gap reward

constexpr Param< std::string >	REWARDFILENAME { "heuristics/alns/rewardfilename" }
	file name to store all rewards and the selection of the bandit

constexpr Param< bool >	SCALEBYEFFORT { "heuristics/alns/scalebyeffort" }
	should the reward be scaled by the effort?

constexpr Param< int >	SEED { "heuristics/alns/seed" }
	initial random seed for bandit algorithms and random decisions by neighborhoods

constexpr Param< bool >	SHOWNBSTATS { "heuristics/alns/shownbstats" }
	show statistics on neighborhoods?

constexpr Param< double >	STARTMINIMPROVE { "heuristics/alns/startminimprove" }
	initial factor by which ALNS should at least improve the incumbent

constexpr Param< bool >	SUBSCIPRANDSEEDS { "heuristics/alns/subsciprandseeds" }
	should random seeds of sub-SCIPs be altered to increase diversification?

constexpr Param< double >	TARGETNODEFACTOR { "heuristics/alns/targetnodefactor" }
	factor by which target node number is eventually increased

constexpr Param< double >	UNFIXTOL { "heuristics/alns/unfixtol" }
	tolerance by which the fixing rate may be exceeded without generic unfixing

constexpr Param< bool >	USEDISTANCES { "heuristics/alns/usedistances" }
	distances from fixed variables be used for variable prioritization

constexpr Param< bool >	USELOCALREDCOST { "heuristics/alns/uselocalredcost" }
	should local reduced costs be used for generic (un)fixing?

constexpr Param< bool >	USEPSCOST { "heuristics/alns/usepscost" }
	should pseudo cost scores be used for variable priorization?

constexpr Param< bool >	USEREDCOST { "heuristics/alns/useredcost" }
	should reduced cost scores be used for variable prioritization?

constexpr Param< bool >	USESUBSCIPHEURS { "heuristics/alns/usesubscipheurs" }
	should the heuristic activate other sub-SCIP heuristics during its search?

constexpr Param< long long >	WAITINGNODES { "heuristics/alns/waitingnodes" }
	number of nodes since last incumbent solution that the heuristic should wait

Detailed Description

Parameters with prefix heuristics/alns.

Variable Documentation

◆ ADJUSTFIXINGRATE

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::ADJUSTFIXINGRATE { "heuristics/alns/adjustfixingrate" }

constexpr

should the heuristic adjust the target fixing rate based on the success?

Definition at line 2358 of file parameters.hpp.

◆ ADJUSTMINIMPROVE

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::ADJUSTMINIMPROVE { "heuristics/alns/adjustminimprove" }

constexpr

should the factor by which the minimum improvement is bound be dynamically updated?

Definition at line 2372 of file parameters.hpp.

◆ ADJUSTTARGETNODES

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::ADJUSTTARGETNODES { "heuristics/alns/adjusttargetnodes" }

constexpr

should the target nodes be dynamically adjusted?

Definition at line 2374 of file parameters.hpp.

◆ ALPHA

constexpr Param<double> scippp::params::HEURISTICS::ALNS::ALPHA { "heuristics/alns/alpha" }

constexpr

parameter to increase the confidence width in UCB

Definition at line 2349 of file parameters.hpp.

◆ BANDITALGO

constexpr Param<char> scippp::params::HEURISTICS::ALNS::BANDITALGO { "heuristics/alns/banditalgo" }

constexpr

the bandit algorithm: (u)pper confidence bounds, (e)xp.3, epsilon (g)reedy

Definition at line 2343 of file parameters.hpp.

◆ BETA

constexpr Param<double> scippp::params::HEURISTICS::ALNS::BETA { "heuristics/alns/beta" }

constexpr

reward offset between 0 and 1 at every observation for Exp.3

Definition at line 2347 of file parameters.hpp.

◆ COPYCUTS

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::COPYCUTS { "heuristics/alns/copycuts" }

constexpr

should cutting planes be copied to the sub-SCIP?

Definition at line 2388 of file parameters.hpp.

◆ DOMOREFIXINGS

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::DOMOREFIXINGS { "heuristics/alns/domorefixings" }

constexpr

should the ALNS heuristic do more fixings by itself based on variable prioritization until the target fixing rate is reached?

Definition at line 2356 of file parameters.hpp.

◆ EPS

constexpr Param<double> scippp::params::HEURISTICS::ALNS::EPS { "heuristics/alns/eps" }

constexpr

increase exploration in epsilon-greedy bandit algorithm

Definition at line 2376 of file parameters.hpp.

◆ FIXTOL

constexpr Param<double> scippp::params::HEURISTICS::ALNS::FIXTOL { "heuristics/alns/fixtol" }

constexpr

tolerance by which the fixing rate may be missed without generic fixing

Definition at line 2390 of file parameters.hpp.

◆ FREQ

constexpr Param<int> scippp::params::HEURISTICS::ALNS::FREQ { "heuristics/alns/freq" }

constexpr

frequency for calling primal heuristic <alns> (-1: never, 0: only at depth freqofs)

Definition at line 2315 of file parameters.hpp.

◆ FREQOFS

constexpr Param<int> scippp::params::HEURISTICS::ALNS::FREQOFS { "heuristics/alns/freqofs" }

constexpr

frequency offset for calling primal heuristic <alns>

Definition at line 2317 of file parameters.hpp.

◆ GAMMA

constexpr Param<double> scippp::params::HEURISTICS::ALNS::GAMMA { "heuristics/alns/gamma" }

constexpr

weight between uniform (gamma ~ 1) and weight driven (gamma ~ 0) probability distribution for exp3

Definition at line 2345 of file parameters.hpp.

◆ INITDURINGROOT

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::INITDURINGROOT { "heuristics/alns/initduringroot" }

constexpr

should the heuristic be executed multiple times during the root node?

Definition at line 2398 of file parameters.hpp.

◆ MAXCALLSSAMESOL

constexpr Param<int> scippp::params::HEURISTICS::ALNS::MAXCALLSSAMESOL { "heuristics/alns/maxcallssamesol" }

constexpr

number of allowed executions of the heuristic on the same incumbent solution (-1: no limit, 0: number of active neighborhoods)

Definition at line 2370 of file parameters.hpp.

◆ MAXDEPTH

constexpr Param<int> scippp::params::HEURISTICS::ALNS::MAXDEPTH { "heuristics/alns/maxdepth" }

constexpr

maximal depth level to call primal heuristic <alns> (-1: no limit)

Definition at line 2319 of file parameters.hpp.

◆ MAXNODES

constexpr Param<long long> scippp::params::HEURISTICS::ALNS::MAXNODES { "heuristics/alns/maxnodes" }

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 2323 of file parameters.hpp.

◆ MINIMPROVEHIGH

constexpr Param<double> scippp::params::HEURISTICS::ALNS::MINIMPROVEHIGH { "heuristics/alns/minimprovehigh" }

constexpr

upper bound for the minimal improvement over the incumbent

Definition at line 2339 of file parameters.hpp.

◆ MINIMPROVELOW

constexpr Param<double> scippp::params::HEURISTICS::ALNS::MINIMPROVELOW { "heuristics/alns/minimprovelow" }

constexpr

lower threshold for the minimal improvement over the incumbent

Definition at line 2337 of file parameters.hpp.

◆ MINNODES

constexpr Param<long long> scippp::params::HEURISTICS::ALNS::MINNODES { "heuristics/alns/minnodes" }

constexpr

minimum number of nodes required to start a sub-SCIP

Definition at line 2327 of file parameters.hpp.

◆ NODESOFS

constexpr Param<long long> scippp::params::HEURISTICS::ALNS::NODESOFS { "heuristics/alns/nodesofs" }

constexpr

offset added to the nodes budget

Definition at line 2325 of file parameters.hpp.

◆ NODESQUOT

constexpr Param<double> scippp::params::HEURISTICS::ALNS::NODESQUOT { "heuristics/alns/nodesquot" }

constexpr

fraction of nodes compared to the main SCIP for budget computation

Definition at line 2331 of file parameters.hpp.

◆ NODESQUOTMIN

constexpr Param<double> scippp::params::HEURISTICS::ALNS::NODESQUOTMIN { "heuristics/alns/nodesquotmin" }

constexpr

lower bound fraction of nodes compared to the main SCIP for budget computation

Definition at line 2333 of file parameters.hpp.

◆ NSOLSLIM

constexpr Param<int> scippp::params::HEURISTICS::ALNS::NSOLSLIM { "heuristics/alns/nsolslim" }

constexpr

limit on the number of improving solutions in a sub-SCIP call

Definition at line 2341 of file parameters.hpp.

◆ PRIORITY

constexpr Param<int> scippp::params::HEURISTICS::ALNS::PRIORITY { "heuristics/alns/priority" }

constexpr

priority of heuristic <alns>

Definition at line 2313 of file parameters.hpp.

◆ RESETWEIGHTS

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::RESETWEIGHTS { "heuristics/alns/resetweights" }

constexpr

should the bandit algorithms be reset when a new problem is read?

Definition at line 2380 of file parameters.hpp.

◆ REWARDBASELINE

constexpr Param<double> scippp::params::HEURISTICS::ALNS::REWARDBASELINE { "heuristics/alns/rewardbaseline" }

constexpr

the reward baseline to separate successful and failed calls

Definition at line 2378 of file parameters.hpp.

◆ REWARDCONTROL

constexpr Param<double> scippp::params::HEURISTICS::ALNS::REWARDCONTROL { "heuristics/alns/rewardcontrol" }

constexpr

reward control to increase the weight of the simple solution indicator and decrease the weight of the closed gap reward

Definition at line 2363 of file parameters.hpp.

◆ REWARDFILENAME

constexpr Param<std::string> scippp::params::HEURISTICS::ALNS::REWARDFILENAME { "heuristics/alns/rewardfilename" }

constexpr

file name to store all rewards and the selection of the bandit

Definition at line 2382 of file parameters.hpp.

◆ SCALEBYEFFORT

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::SCALEBYEFFORT { "heuristics/alns/scalebyeffort" }

constexpr

should the reward be scaled by the effort?

Definition at line 2386 of file parameters.hpp.

◆ SEED

constexpr Param<int> scippp::params::HEURISTICS::ALNS::SEED { "heuristics/alns/seed" }

constexpr

initial random seed for bandit algorithms and random decisions by neighborhoods

Definition at line 2367 of file parameters.hpp.

◆ SHOWNBSTATS

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::SHOWNBSTATS { "heuristics/alns/shownbstats" }

constexpr

show statistics on neighborhoods?

Definition at line 2321 of file parameters.hpp.

◆ STARTMINIMPROVE

constexpr Param<double> scippp::params::HEURISTICS::ALNS::STARTMINIMPROVE { "heuristics/alns/startminimprove" }

constexpr

initial factor by which ALNS should at least improve the incumbent

Definition at line 2335 of file parameters.hpp.

◆ SUBSCIPRANDSEEDS

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::SUBSCIPRANDSEEDS { "heuristics/alns/subsciprandseeds" }

constexpr

should random seeds of sub-SCIPs be altered to increase diversification?

Definition at line 2384 of file parameters.hpp.

◆ TARGETNODEFACTOR

constexpr Param<double> scippp::params::HEURISTICS::ALNS::TARGETNODEFACTOR { "heuristics/alns/targetnodefactor" }

constexpr

factor by which target node number is eventually increased

Definition at line 2365 of file parameters.hpp.

◆ UNFIXTOL

constexpr Param<double> scippp::params::HEURISTICS::ALNS::UNFIXTOL { "heuristics/alns/unfixtol" }

constexpr

tolerance by which the fixing rate may be exceeded without generic unfixing

Definition at line 2392 of file parameters.hpp.

◆ USEDISTANCES

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::USEDISTANCES { "heuristics/alns/usedistances" }

constexpr

distances from fixed variables be used for variable prioritization

Definition at line 2351 of file parameters.hpp.

◆ USELOCALREDCOST

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::USELOCALREDCOST { "heuristics/alns/uselocalredcost" }

constexpr

should local reduced costs be used for generic (un)fixing?

Definition at line 2394 of file parameters.hpp.

◆ USEPSCOST

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::USEPSCOST { "heuristics/alns/usepscost" }

constexpr

should pseudo cost scores be used for variable priorization?

Definition at line 2396 of file parameters.hpp.

◆ USEREDCOST

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::USEREDCOST { "heuristics/alns/useredcost" }

constexpr

should reduced cost scores be used for variable prioritization?

Definition at line 2353 of file parameters.hpp.

◆ USESUBSCIPHEURS

constexpr Param<bool> scippp::params::HEURISTICS::ALNS::USESUBSCIPHEURS { "heuristics/alns/usesubscipheurs" }

constexpr

should the heuristic activate other sub-SCIP heuristics during its search?

Definition at line 2360 of file parameters.hpp.

◆ WAITINGNODES

constexpr Param<long long> scippp::params::HEURISTICS::ALNS::WAITINGNODES { "heuristics/alns/waitingnodes" }

constexpr

number of nodes since last incumbent solution that the heuristic should wait

Definition at line 2329 of file parameters.hpp.

SCIP++ refs/heads/main

Namespaces

Variables

Detailed Description

Variable Documentation

◆ ADJUSTFIXINGRATE

◆ ADJUSTMINIMPROVE

◆ ADJUSTTARGETNODES

◆ ALPHA

◆ BANDITALGO

◆ BETA

◆ COPYCUTS

◆ DOMOREFIXINGS

◆ EPS

◆ FIXTOL

◆ FREQ

◆ FREQOFS

◆ GAMMA

◆ INITDURINGROOT

◆ MAXCALLSSAMESOL

◆ MAXDEPTH

◆ MAXNODES

◆ MINIMPROVEHIGH

◆ MINIMPROVELOW

◆ MINNODES

◆ NODESOFS

◆ NODESQUOT

◆ NODESQUOTMIN

◆ NSOLSLIM

◆ PRIORITY

◆ RESETWEIGHTS

◆ REWARDBASELINE

◆ REWARDCONTROL

◆ REWARDFILENAME

◆ SCALEBYEFFORT

◆ SEED

◆ SHOWNBSTATS

◆ STARTMINIMPROVE

◆ SUBSCIPRANDSEEDS

◆ TARGETNODEFACTOR

◆ UNFIXTOL

◆ USEDISTANCES

◆ USELOCALREDCOST

◆ USEPSCOST

◆ USEREDCOST

◆ USESUBSCIPHEURS

◆ WAITINGNODES