Package org.tweetyproject.math.opt.solver

Class SimpleGeneticOptimizationSolverCombinatorics

java.lang.Object

org.tweetyproject.math.opt.solver.Solver

org.tweetyproject.math.opt.solver.CombinatoricsSolver

org.tweetyproject.math.opt.solver.SimpleGeneticOptimizationSolverCombinatorics

public class SimpleGeneticOptimizationSolverCombinatorics
extends CombinatoricsSolver

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
class	SimpleGeneticOptimizationSolverCombinatorics.FitnessComparator	Compares individuals by the fitness (value of the target function)

Constructor Summary

Constructors

Constructor	Description
SimpleGeneticOptimizationSolverCombinatorics(int populationSize, int populationIncreaseMutation, int populationIncreaseCrossOver, int minIterations, double precision)	Creates a new simple genetic optimization solver.

Method Summary

Modifier and Type	Method	Description
static boolean	isInstalled()
java.util.ArrayList<ElementOfCombinatoricsProb>	solve(CombinatoricsProblem prob)	Returns the solution according the problem; problem has to be minimizing (which only contains variables with defined upper and lower bounds).

Methods inherited from class org.tweetyproject.math.opt.solver.CombinatoricsSolver

solve

Methods inherited from class org.tweetyproject.math.opt.solver.Solver

getDefaultGeneralSolver, getDefaultIntegerLinearSolver, getDefaultLinearSolver, hasDefaultGeneralSolver, hasDefaultIntegerLinearSolver, hasDefaultLinearSolver, setDefaultGeneralSolver, setDefaultIntegerLinearSolver, setDefaultLinearSolver

Methods inherited from class java.lang.Object

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

Constructor Detail

SimpleGeneticOptimizationSolverCombinatorics

public SimpleGeneticOptimizationSolverCombinatorics(int populationSize,
                                                    int populationIncreaseMutation,
                                                    int populationIncreaseCrossOver,
                                                    int minIterations,
                                                    double precision)

Creates a new simple genetic optimization solver.

Parameters:

populationSize - The size of the population

populationIncreaseMutation - How many new individuals are created by mutation (per individual)

populationIncreaseCrossOver - How many new individuals are created by cross-over (per pair of individuals)

minIterations - The minimal number of iterations

precision - If an iteration improves less than this value the algorithm ends

Method Detail

solve

public java.util.ArrayList<ElementOfCombinatoricsProb> solve(CombinatoricsProblem prob)

Returns the solution according the problem; problem has to be minimizing (which only contains variables with defined upper and lower bounds).

Parameters:

prob - the problem

Returns:

the optimal solution found in the search

isInstalled

public static boolean isInstalled()
                           throws java.lang.UnsupportedOperationException

Throws:

java.lang.UnsupportedOperationException