Package jeco.core.benchmarks.zdt
Class ZDT2
java.lang.Object
jeco.core.problem.Problem<Variable<Double>>
jeco.core.benchmarks.zdt.ZDT
jeco.core.benchmarks.zdt.ZDT2
ZDT2 benchmark problem
ZDT2 is a multi-objective optimization problem
f1(x) = x1
f2(x) = g(x) * h(f1(x), g(x))
g(x) = 1 + 9 * (sum(xj) / (n-1))
h(f1, g) = 1 - (f1 / g)^2
xj in [0, 1]
Pareto optimal front: convex
-
Field Summary
Fields inherited from class jeco.core.problem.Problem
INFINITY, lowerBound, numberOfObjectives, numberOfVariables, upperBound
-
Constructor Summary
Constructors -
Method Summary
Methods inherited from class jeco.core.benchmarks.zdt.ZDT
evaluate, newRandomSetOfSolutions
Methods inherited from class jeco.core.problem.Problem
getLowerBound, getNumberOfObjectives, getNumberOfVariables, getUpperBound
-
Constructor Details
-
ZDT2
Constructor- Parameters:
numberOfVariables
- Number of variables
-
ZDT2
public ZDT2()Constructor
-
-
Method Details
-
evaluate
Description copied from class:ZDT
Evaluate a single solution -
computeParetoOptimalFront
Compute the Pareto optimal front- Parameters:
n
- Number of points- Returns:
- Pareto optimal front
-
clone
-