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 |
Modifier and Type | Method and Description |
---|---|
<V extends Variable> |
Solver.getSearch() |
default AbstractStrategy |
Settings.makeDefaultSearch(Model model)
Creates a default search strategy for the input model
|
Modifier and Type | Method and Description |
---|---|
void |
Solver.setSearch(AbstractStrategy... strategies)
Override the default search strategies to use in
this . |
Modifier and Type | Class and Description |
---|---|
class |
ObjectiveStrategy
Class that defines a branching strategy over the objective variable
|
Modifier and Type | Field and Description |
---|---|
protected AbstractStrategy |
MoveBinaryDFS.strategy
Search strategy to extend the search tree
|
Modifier and Type | Method and Description |
---|---|
<V extends Variable> |
MoveSeq.getStrategy() |
<V extends Variable> |
MoveRestart.getStrategy() |
<V extends Variable> |
MoveLNS.getStrategy() |
<V extends Variable> |
MoveLearnBinaryTDR.getStrategy() |
<V extends Variable> |
MoveBinaryDFS.getStrategy() |
<V extends Variable> |
Move.getStrategy()
Returns the search strategy in use.
|
Modifier and Type | Method and Description |
---|---|
<V extends Variable> |
MoveSeq.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
MoveRestart.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
MoveLNS.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
MoveLearnBinaryTDR.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
MoveBinaryDFS.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
Move.setStrategy(AbstractStrategy<V> aStrategy)
Defines a search strategy, that is, a service which computes and returns decisions.
|
Constructor and Description |
---|
MoveBinaryDDS(AbstractStrategy strategy,
int discrepancy,
IEnvironment environment)
Create a DFS with binary decisions
|
MoveBinaryDFS(AbstractStrategy strategy)
Create this move with a search strategy
|
MoveBinaryHBFS(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
|
Modifier and Type | Class and 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.
|
Modifier and Type | Method and Description |
---|---|
static AbstractStrategy<IntVar> |
Search.activityBasedSearch(IntVar... vars)
Create an Activity based search strategy.
|
static AbstractStrategy<IntVar> |
Search.bestBound(AbstractStrategy 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 AbstractStrategy |
Search.conflictOrderingSearch(AbstractStrategy 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 to
DomOverWDeg and assign it to its lower bound |
static AbstractStrategy |
Search.greedySearch(AbstractStrategy search)
Make the input search strategy greedy, that is, decisions can be applied but not refuted.
|
static AbstractStrategy<IntVar> |
Search.intVarSearch(IntVar... vars)
Builds a default search heuristics of integer variables
Relies on
Search.domOverWDegSearch(IntVar...) |
static AbstractStrategy |
Search.lastConflict(AbstractStrategy formerSearch)
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.lastConflict(AbstractStrategy 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) |
Modifier and Type | Method and Description |
---|---|
static AbstractStrategy<IntVar> |
Search.bestBound(AbstractStrategy 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 AbstractStrategy |
Search.conflictOrderingSearch(AbstractStrategy 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 AbstractStrategy |
Search.lastConflict(AbstractStrategy formerSearch)
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.lastConflict(AbstractStrategy 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) |
Constructor and Description |
---|
BoundSearch(AbstractStrategy mainSearch) |
Modifier and Type | Class and 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.
|
Modifier and Type | Class and 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 found
|
class |
FullyRandom
Project: choco-solver.
|
class |
GreedyBranching |
class |
IntStrategy
Class to perform branching decisions over integer variables
|
class |
LastConflict
Last Conflict heuristic
Composite heuristic which hacks a mainStrategy by forcing the
use of variables involved in recent conflicts
|
class |
RealStrategy
Define a strategy based on
RealVar . |
class |
SetStrategy
Strategy for branching on set variables
|
class |
StrategiesSequencer
A
StrategiesSequencer is class for AbstractStrategy composition. |
Modifier and Type | Field and Description |
---|---|
protected AbstractStrategy<Variable> |
LastConflict.mainStrategy
The main strategy declared in the solver
|
protected AbstractStrategy<V> |
ConflictOrderingSearch.mainStrategy
The main strategy declared in the solver
|
Constructor and Description |
---|
ConflictOrderingSearch(Model model,
AbstractStrategy<V> mainStrategy)
Creates a conflict-ordering search
|
FindAndProve(V[] vars,
AbstractStrategy<V> heurToFindASol,
AbstractStrategy<V> heurToProveOpt)
Heuristic which switches from one heuristic (heurToFindASol) to another (heurToProveOpt)
once a solution has been found
|
FindAndProve(V[] vars,
AbstractStrategy<V> heurToFindASol,
AbstractStrategy<V> heurToProveOpt)
Heuristic which switches from one heuristic (heurToFindASol) to another (heurToProveOpt)
once a solution has been found
|
GreedyBranching(AbstractStrategy mainSearch) |
LastConflict(Model model,
AbstractStrategy<Variable> mainStrategy,
int k)
Creates a last conflict heuristic
|
StrategiesSequencer(AbstractStrategy... strategies) |
StrategiesSequencer(IEnvironment environment,
AbstractStrategy... strategies) |
Copyright © 2017. All rights reserved.