Class SimulatedAnnealingOnConstrProb


  • public class SimulatedAnnealingOnConstrProb
    extends Solver
    implements the Simulated Annealing algorithm for optimization problems
    Author:
    Sebastian Franke
    • Constructor Detail

      • SimulatedAnnealingOnConstrProb

        public SimulatedAnnealingOnConstrProb​(double startTemp,
                                              double decreasePerIt,
                                              int maxStepsWithNoImprove)
    • Method Detail

      • chooseANeighbor

        public java.util.Map<Variable,​Term> chooseANeighbor​(java.util.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 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.
        Specified by:
        solve in class Solver
        Parameters:
        problem - the actual problem
        Returns:
        a mapping from variables of the problem to terms.