Package org.moeaframework.problem.single
Class Ackley
java.lang.Object
org.moeaframework.problem.AbstractProblem
org.moeaframework.problem.single.Ackley
- All Implemented Interfaces:
AutoCloseable
,Problem
The single-objective Ackley problem with an optimum at
x = (0, 0)
with f(x) = 0
.
References:
- Ackley, D. H. (1987) "A Connectionist Machine for Genetic Hillclimbing", Kluwer Academic Publishers, Boston MA.
-
Field Summary
Fields inherited from class org.moeaframework.problem.AbstractProblem
numberOfConstraints, numberOfObjectives, numberOfVariables
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionvoid
Evaluates the solution, updating the solution's objectives in place.Returns the reference set, typically a single solution unless the problem has multiple local minima, for this single objective problem.Returns a new solution for this problem.Methods inherited from class org.moeaframework.problem.AbstractProblem
close, getName, getNumberOfConstraints, getNumberOfObjectives, getNumberOfVariables
-
Constructor Details
-
Ackley
public Ackley()Constructs a new instance of the Ackley problem.
-
-
Method Details
-
evaluate
Description copied from interface:Problem
Evaluates the solution, updating the solution's objectives in place. Algorithms must explicitly call this method when appropriate to evaluate new solutions or reevaluate modified solutions.- Parameters:
solution
- the solution to be evaluated
-
newSolution
Description copied from interface:Problem
Returns a new solution for this problem. Implementations must initialize the variables so that the valid range of values is defined, but typically leave the actual value at a default or undefined state.- Returns:
- a new solution for this problem
-
getReferenceSet
Returns the reference set, typically a single solution unless the problem has multiple local minima, for this single objective problem.- Returns:
- the reference set
-