Interface IMoveFactory
-
-
Method Summary
All Methods Instance Methods Default Methods Modifier and Type Method Description default voidsetDDS(int discrepancy)Depth-bounded Discrepancy Search[1] algorithms with binary decisionsdefault voidsetDFS()Depth-First Search algorithm with binary decisionsdefault voidsetGeometricalRestart(long base, double geometricalFactor, ICounter restartStrategyLimit, int restartLimit)Build a geometrical restart strategy.default voidsetHBFS(double a, double b, long N)Creates a move object based on: Hybrid Best-First Search[1] algorithms with binary decisions.default voidsetLDS(int discrepancy)Limited Discrepancy Search[1] algorithms with binary decisionsdefault voidsetLNS(INeighbor neighbor)Creates a Move object based on Large Neighborhood Search.default voidsetLNS(INeighbor neighbor, ICounter restartCounter)Creates a Move object based on Large Neighborhood Search.default voidsetLubyRestart(long scaleFactor, ICounter restartStrategyLimit, int restartLimit)Branch a luby restart strategy to the modeldefault voidsetRestartOnSolutions()Creates a Move object that encapsulates the current move within a restart move.default voidsetRestarts(LongCriterion restartCriterion, org.chocosolver.cutoffseq.ICutoffStrategy restartStrategy, int restartsLimit)Creates a Move object that encapsulates the current move within a restart move.
-
-
-
Method Detail
-
setDFS
default void setDFS()
Depth-First Search algorithm with binary decisions
-
setLDS
default void setLDS(int discrepancy)
Limited Discrepancy Search[1] algorithms with binary decisions[1]:W.D. Harvey and M.L.Ginsberg, Limited Discrepancy Search, IJCAI-95.
- Parameters:
discrepancy- the maximum discrepancy
-
setDDS
default void setDDS(int discrepancy)
Depth-bounded Discrepancy Search[1] algorithms with binary decisions[1]:T. Walsh, Depth-bounded Discrepancy Search, IJCAI-97.
- Parameters:
discrepancy- the maximum discrepancy
-
setHBFS
default void setHBFS(double a, double b, long N)Creates a move object based on: Hybrid Best-First Search[1] algorithms with binary decisions.[1]:D. Allouche, S. de Givry, G. Katsirelos, T. Schiex, M. Zytnicki, Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP, CP-2015.
- Parameters:
a- lower bound to limit the rate of redundantly propagated decisionsb- upper bound to limit the rate of redundantly propagated decisions.N- backtrack limit for each DFS try, should be large enough to limit redundancy
-
setRestarts
default void setRestarts(LongCriterion restartCriterion, org.chocosolver.cutoffseq.ICutoffStrategy restartStrategy, int restartsLimit)
Creates a Move object that encapsulates the current move within a restart move. Every time therestartCriterionis met, a restart is done, the new restart limit is updated thanks torestartStrategy. There will be at mostrestartsLimitrestarts.- Parameters:
restartCriterion- the restart criterion, that is, the condition which triggers a restartrestartStrategy- the way restart limit (evaluated inrestartCriterion) is updated, that is, computes the next limitrestartsLimit- number of allowed restarts
-
setLubyRestart
default void setLubyRestart(long scaleFactor, ICounter restartStrategyLimit, int restartLimit)Branch a luby restart strategy to the model- Parameters:
scaleFactor- scale factorrestartStrategyLimit- restart triggerrestartLimit- restart limits (limit of number of restarts)
-
setGeometricalRestart
default void setGeometricalRestart(long base, double geometricalFactor, ICounter restartStrategyLimit, int restartLimit)Build a geometrical restart strategy. The restartStrategyLimit is aICounterto observe. Once this counter reaches a limit, restart occurs and the next cutoff is computed. At step n, the next cutoff is computed with the following function : b*g^n.- Parameters:
base- the initial limitgeometricalFactor- geometrical factorrestartStrategyLimit- restart triggerrestartLimit- restart limits (limit of number of restarts)
-
setRestartOnSolutions
default void setRestartOnSolutions()
Creates a Move object that encapsulates the current move within a restart move. Every time a solution is found, a restart is done.
-
setLNS
default void setLNS(INeighbor neighbor, ICounter restartCounter)
Creates a Move object based on Large Neighborhood Search. It encapsulates the current move within a LNS move. Anytime a solution is encountered, it is recorded and serves as a basis for theneighbor. Theneighborcreates a fragment: selects variables to freeze/unfreeze wrt the last solution found. If a fragment cannot be extended to a solution, a new one is selected by restarting the search. If a fragment induces a search space which a too big to be entirely evaluated, restarting the search can be forced using therestartCriterion. A fast restart strategy is often a good choice.- Parameters:
neighbor- the neighbor for the LNSrestartCounter- the (fast) restart counter. Initial limit gives the frequency.
-
setLNS
default void setLNS(INeighbor neighbor)
Creates a Move object based on Large Neighborhood Search. It encapsulates the current move within a LNS move. Anytime a solution is encountered, it is recorded and serves as a basis for theneighbor. Theneighborcreates a fragment: selects variables to freeze/unfreeze wrt the last solution found. If a fragment cannot be extended to a solution, a new one is selected by restarting the search.- Parameters:
neighbor- the neighbor for the LNS- See Also:
setLNS(INeighbor, ICounter)
-
-