Package org.tweetyproject.math.opt.solver

Class SimulatedAnnealingOnConstrProb

java.lang.Object

org.tweetyproject.math.opt.solver.Solver

org.tweetyproject.math.opt.solver.SimulatedAnnealingOnConstrProb

public class SimulatedAnnealingOnConstrProb
extends Solver

implements the Simulated Annealing algorithm for optimization problems

Author:

Sebastian Franke

Constructor Summary

Constructors

Constructor	Description
SimulatedAnnealingOnConstrProb(double startTemp, double decreasePerIt, int maxStepsWithNoImprove)

Method Summary

Modifier and Type	Method	Description
Map<Variable,Term>	chooseANeighbor(Map<Variable,Term> currSol, int minIterations, int maxIterations, double threshold, Term targetFunc)
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

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

SimulatedAnnealingOnConstrProb

public SimulatedAnnealingOnConstrProb(double startTemp,
 double decreasePerIt,
 int maxStepsWithNoImprove)

Method Details

chooseANeighbor

public Map<Variable,Term> chooseANeighbor(Map<Variable,Term> currSol,
 int minIterations,
 int maxIterations,
 double threshold,
 Term targetFunc)

Parameters:

minIterations - : the minimum amount of solutions to be created

maxIterations - : the maximum amount of solutions to be created

threshold - : if a solution with the quality of threshold is reached we do maximum 10 more tries

currSol - : the solution that every newly created solution uses as a initial solution in createNewSol

targetFunc - the target function

Returns:

the best solution that was found and is a mutant of currSol

solve

public 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.

Specified by:

solve in class Solver

Parameters:

problem - the actual problem

Returns:

a mapping from variables of the problem to terms.