Class TabuSearchOnConstrProb
java.lang.Object
org.tweetyproject.math.opt.solver.Solver
org.tweetyproject.math.opt.solver.TabuSearchOnConstrProb
implements a simple Tabu Search without long term memory
 for optimization problems
- Author:
 - Sebastian Franke
 
- 
Constructor Summary
ConstructorsConstructorDescriptionTabuSearchOnConstrProb(int maxIteration, int tabuSize, int maxStepsWithNoImprove) Constructor - 
Method Summary
Modifier and TypeMethodDescriptionchooseANeighbor(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term t) Return the best solution that was found and is a mutant of currSolComputes a solution to the given constraint satisfaction or optimization problem, i.e.Methods inherited from class org.tweetyproject.math.opt.solver.Solver
getDefaultGeneralSolver, getDefaultIntegerLinearSolver, getDefaultLinearSolver, hasDefaultGeneralSolver, hasDefaultIntegerLinearSolver, hasDefaultLinearSolver, isInstalled, setDefaultGeneralSolver, setDefaultIntegerLinearSolver, setDefaultLinearSolver 
- 
Constructor Details
- 
TabuSearchOnConstrProb
public TabuSearchOnConstrProb(int maxIteration, int tabuSize, int maxStepsWithNoImprove) Constructor- Parameters:
 maxIteration- max iterationstabuSize- tabu sizemaxStepsWithNoImprove- max steps with no improvement
 
 - 
 - 
Method Details
- 
chooseANeighbor
public Map<Variable,Term> chooseANeighbor(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term t) Return the best solution that was found and is a mutant of currSol- Parameters:
 currSol- : the solution that every newly created solution uses as a initial solution in createNewSolminIterations- : the minimum amount of solutions to be createdmaxIterations- : the maximum amount of solutions to be createdthreshold- : if a solution with the quality of threshold is reached we do maximum 10 more triest- the term- Returns:
 - the best solution that was found and is a mutant of currSol
 
 - 
solve
Description copied from class:SolverComputes a solution to the given constraint satisfaction or optimization problem, i.e. a mapping from variables of the problem to terms. 
 -