Uses of Class
org.chocosolver.solver.search.strategy.strategy.AbstractStrategy
-
Packages that use AbstractStrategy Package Description org.chocosolver.solver A package devoted to Model and resolution tools.org.chocosolver.solver.objective org.chocosolver.solver.search.loop.move org.chocosolver.solver.search.strategy org.chocosolver.solver.search.strategy.selectors.variables org.chocosolver.solver.search.strategy.strategy -
-
Uses of AbstractStrategy in org.chocosolver.solver
Methods in org.chocosolver.solver that return AbstractStrategy Modifier and Type Method Description <V extends Variable>
AbstractStrategy<V>Solver. getSearch()
AbstractStrategy
DefaultSettings. makeDefaultSearch(Model model)
AbstractStrategy
Settings. makeDefaultSearch(Model model)
Creates a default search strategy for the input modelMethods in org.chocosolver.solver with parameters of type AbstractStrategy Modifier and Type Method Description void
Solver. setSearch(AbstractStrategy... strategies)
Override the default search strategies to use inthis
.Method parameters in org.chocosolver.solver with type arguments of type AbstractStrategy Modifier and Type Method Description DefaultSettings
DefaultSettings. setDefaultSearch(Function<Model,AbstractStrategy> defaultSearch)
Settings
Settings. setDefaultSearch(Function<Model,AbstractStrategy> defaultSearch)
Define a default search strategy for the input model -
Uses of AbstractStrategy in org.chocosolver.solver.objective
Subclasses of AbstractStrategy in org.chocosolver.solver.objective Modifier and Type Class Description class
ObjectiveStrategy
Class that defines a branching strategy over the objective variable -
Uses of AbstractStrategy in org.chocosolver.solver.search.loop.move
Fields in org.chocosolver.solver.search.loop.move declared as AbstractStrategy Modifier and Type Field Description protected AbstractStrategy
MoveBinaryDFS. strategy
Search strategy to extend the search treeMethods in org.chocosolver.solver.search.loop.move that return AbstractStrategy Modifier and Type Method Description <V extends Variable>
AbstractStrategy<V>Move. getStrategy()
Returns the search strategy in use.<V extends Variable>
AbstractStrategy<V>MoveBinaryDFS. getStrategy()
<V extends Variable>
AbstractStrategy<V>MoveLNS. getStrategy()
<V extends Variable>
AbstractStrategy<V>MoveRestart. getStrategy()
<V extends Variable>
AbstractStrategy<V>MoveSeq. getStrategy()
Methods in org.chocosolver.solver.search.loop.move with parameters of type AbstractStrategy Modifier and Type Method Description <V extends Variable>
voidMove. setStrategy(AbstractStrategy<V> aStrategy)
Defines a search strategy, that is, a service which computes and returns decisions.<V extends Variable>
voidMoveBinaryDFS. setStrategy(AbstractStrategy<V> aStrategy)
<V extends Variable>
voidMoveLNS. setStrategy(AbstractStrategy<V> aStrategy)
<V extends Variable>
voidMoveRestart. setStrategy(AbstractStrategy<V> aStrategy)
<V extends Variable>
voidMoveSeq. setStrategy(AbstractStrategy<V> aStrategy)
Constructors in org.chocosolver.solver.search.loop.move with parameters of type AbstractStrategy Constructor Description MoveBinaryDDS(AbstractStrategy strategy, int discrepancy, IEnvironment environment)
Create a DFS with binary decisionsMoveBinaryDFS(AbstractStrategy strategy)
Create this move with a search strategyMoveBinaryHBFS(Model model, AbstractStrategy strategy, double a, double b, long N)
Create a move dedicated to run an Hybrid Best-First Search[1] (HBFS) with binary decisions.MoveBinaryLDS(AbstractStrategy strategy, int discrepancy, IEnvironment environment)
Create a DFS with binary decisions -
Uses of AbstractStrategy in org.chocosolver.solver.search.strategy
Subclasses of AbstractStrategy in org.chocosolver.solver.search.strategy Modifier and Type Class Description class
BoundSearch
BEWARE: ONLY FOR INTEGERS (lets the default search work for other variable types) Search heuristic combined with a constraint performing strong consistency on the next decision variable and branching on the value with the best objective bound (for optimization) and branches on the lower bound for SAT problems.Methods in org.chocosolver.solver.search.strategy that return AbstractStrategy Modifier and Type Method Description static AbstractStrategy<IntVar>
Search. activityBasedSearch(IntVar... vars)
Create an Activity based search strategy.static AbstractStrategy<IntVar>
Search. bestBound(AbstractStrategy<IntVar> formerSearch)
Search heuristic combined with a constraint performing strong consistency on the next decision variable and branching on the value with the best objective bound (for optimization) and branches on the lower bound for SAT problems.static <V extends Variable>
AbstractStrategy<V>Search. conflictOrderingSearch(AbstractStrategy<V> formerSearch)
Use the conflict ordering search as a pluggin to improve a former search heuristic Should be set after specifying a search strategy.static AbstractStrategy
Search. defaultSearch(Model model)
Creates a default search strategy for the given model.static AbstractStrategy<IntVar>
Search. domOverWDegSearch(IntVar... vars)
Assignment strategy which selects a variable according toDomOverWDeg
and assign it to its lower boundstatic AbstractStrategy
Search. greedySearch(AbstractStrategy search)
Make the input search strategy greedy, that is, decisions can be applied but not refuted.static AbstractStrategy
Search. ibexSolving(Model model)
Create a strategy which lets Ibex terminates the solving process for the CSP, once all integer variables have been instantiated.static AbstractStrategy<IntVar>
Search. intVarSearch(IntVar... vars)
Builds a default search heuristics of integer variables Variable selection relies onSearch.domOverWDegSearch(IntVar...)
Value selection relies on InDomainBest for optimization and InDomainMin for satisfactionstatic <V extends Variable>
AbstractStrategy<V>Search. lastConflict(AbstractStrategy<V> formerSearch)
Use the last conflict heuristic as a pluggin to improve a former search heuristic Should be set after specifying a search strategy.static <V extends Variable>
AbstractStrategy<V>Search. lastConflict(AbstractStrategy<V> formerSearch, int k)
Use the last conflict heuristic as a pluggin to improve a former search heuristic Should be set after specifying a search strategy.static AbstractStrategy<IntVar>
Search. objectiveStrategy(IntVar objective, OptimizationPolicy optPolicy)
Defines a branching strategy over the objective variable Note that it is only activated after a first solution.static AbstractStrategy
Search. sequencer(AbstractStrategy... searches)
Methods in org.chocosolver.solver.search.strategy with parameters of type AbstractStrategy Modifier and Type Method Description static AbstractStrategy<IntVar>
Search. bestBound(AbstractStrategy<IntVar> formerSearch)
Search heuristic combined with a constraint performing strong consistency on the next decision variable and branching on the value with the best objective bound (for optimization) and branches on the lower bound for SAT problems.static <V extends Variable>
AbstractStrategy<V>Search. conflictOrderingSearch(AbstractStrategy<V> formerSearch)
Use the conflict ordering search as a pluggin to improve a former search heuristic Should be set after specifying a search strategy.static AbstractStrategy
Search. greedySearch(AbstractStrategy search)
Make the input search strategy greedy, that is, decisions can be applied but not refuted.static <V extends Variable>
AbstractStrategy<V>Search. lastConflict(AbstractStrategy<V> formerSearch)
Use the last conflict heuristic as a pluggin to improve a former search heuristic Should be set after specifying a search strategy.static <V extends Variable>
AbstractStrategy<V>Search. lastConflict(AbstractStrategy<V> formerSearch, int k)
Use the last conflict heuristic as a pluggin to improve a former search heuristic Should be set after specifying a search strategy.static AbstractStrategy
Search. sequencer(AbstractStrategy... searches)
Constructors in org.chocosolver.solver.search.strategy with parameters of type AbstractStrategy Constructor Description BoundSearch(AbstractStrategy<IntVar> mainSearch)
-
Uses of AbstractStrategy in org.chocosolver.solver.search.strategy.selectors.variables
Subclasses of AbstractStrategy in org.chocosolver.solver.search.strategy.selectors.variables Modifier and Type Class Description class
ActivityBased
Implementation of the search described in: "Activity-Based Search for Black-Box Constraint Propagramming Solver", Laurent Michel and Pascal Van Hentenryck, CPAIOR12.class
DomOverWDeg
Implementation of DowOverWDeg[1]class
ImpactBased
Implementation of the search described in: "Impact-Based Search Strategies for Constraint Programming", Philippe Refalo, CP2004. -
Uses of AbstractStrategy in org.chocosolver.solver.search.strategy.strategy
Subclasses of AbstractStrategy in org.chocosolver.solver.search.strategy.strategy Modifier and Type Class Description class
ConflictOrderingSearch<V extends Variable>
Conflict Ordering Search Composite heuristic which hacks a mainStrategy by forcing the use of variables involved in recent conflicts See "Conflict Ordering Search for Scheduling Problems", Steven Gay et al., CP2015.class
FindAndProve<V extends Variable>
Enables to switch from one heuristic to another once a solution has been foundclass
FullyRandom
Project: choco-solver.class
GreedyBranching
class
IntStrategy
Class to perform branching decisions over integer variablesclass
LastConflict<V extends Variable>
Last Conflict heuristic Composite heuristic which hacks a mainStrategy by forcing the use of variables involved in recent conflictsclass
RealStrategy
Define a strategy based onRealVar
.class
SetStrategy
Strategy for branching on set variablesclass
StrategiesSequencer
AStrategiesSequencer
is class forAbstractStrategy
composition.Constructors in org.chocosolver.solver.search.strategy.strategy with parameters of type AbstractStrategy Constructor Description ConflictOrderingSearch(Model model, AbstractStrategy<V> mainStrategy)
Creates a conflict-ordering searchFindAndProve(V[] vars, AbstractStrategy<V> heurToFindASol, AbstractStrategy<V> heurToProveOpt)
Heuristic which switches from one heuristic (heurToFindASol) to another (heurToProveOpt) once a solution has been foundGreedyBranching(AbstractStrategy mainSearch)
LastConflict(Model model, AbstractStrategy<V> mainStrategy, int k)
Creates a last conflict heuristicStrategiesSequencer(IEnvironment environment, AbstractStrategy... strategies)
StrategiesSequencer(AbstractStrategy... strategies)
-