Class IteratedLocalSearchOnConstrProb
- java.lang.Object
-
- org.tweetyproject.math.opt.solver.Solver
-
- org.tweetyproject.math.opt.solver.IteratedLocalSearchOnConstrProb
-
public class IteratedLocalSearchOnConstrProb extends Solver
implements the Iterates local search algorithm for optimization problems- Author:
- Sebastian Franke
-
-
Constructor Summary
Constructors Constructor Description IteratedLocalSearchOnConstrProb(double perturbationStrength, int maxnumberOfRestarts, int maxIterations)
-
Method Summary
Modifier and Type Method Description java.util.Map<Variable,Term>
bestNeighbor(java.util.Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term t)
double
evaluate(java.util.Map<Variable,Term> sol, Term minT)
java.util.Map<Variable,Term>
pertubate(java.util.Map<Variable,Term> currSol)
changes the solution drastically to escape a local minimumjava.util.Map<Variable,Term>
solve(GeneralConstraintSatisfactionProblem problem)
Computes 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
-
-
-
-
Method Detail
-
bestNeighbor
public java.util.Map<Variable,Term> bestNeighbor(java.util.Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term t)
- Parameters:
minIterations
- : 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 triescurrSol
- : the solution that every newly created solution uses as a initial solution in createNewSolt
- : some term- Returns:
- the best solution that was found and is a mutant of currSol
-
pertubate
public java.util.Map<Variable,Term> pertubate(java.util.Map<Variable,Term> currSol)
changes the solution drastically to escape a local minimum- Parameters:
currSol
- the solution to be pertubated- Returns:
- a new mapping
-
solve
public java.util.Map<Variable,Term> solve(GeneralConstraintSatisfactionProblem problem)
Description copied from class:Solver
Computes a solution to the given constraint satisfaction or optimization problem, i.e. a mapping from variables of the problem to terms.
-
-