Package jeco.core.benchmarks.dtlz

Class DTLZ4

java.lang.Object
jeco.core.problem.Problem<Variable<Double>>
jeco.core.benchmarks.dtlz.DTLZ
jeco.core.benchmarks.dtlz.DTLZ4
public class DTLZ4 extends DTLZ
DTLZ4 problem This class represents the DTLZ4 problem. It is a subclass of the DTLZ class. The DTLZ4 problem has the following properties: - Number of variables: 12 - Number of objectives: 3 - Bounds for variables: [0, 1] - Type of variables: real - Pareto front: convex - Pareto set: convex The DTLZ4 problem is defined as follows: - Minimize f1, f2, f3 - f1 = 1 + g - f2 = 1 + g - f3 = 1 + g - g = sum_{i=numberOfVariables-k+1}^{numberOfVariables} (x_i - 0.5)^2 - k = numberOfVariables - numberOfObjectives + 1 - x_i in [0, 1] - i = 1, 2, ..., numberOfVariables

  • Constructor Details

    • DTLZ4

      public DTLZ4(Integer numberOfVariables)
      Constructor
      Parameters:
      numberOfVariables - Number of variables

    • DTLZ4

      public DTLZ4()
      Constructor

  • Method Details