// Fonseca.java // // Author: // Antonio J. Nebro <antonio@lcc.uma.es> // Juan J. Durillo <durillo@lcc.uma.es> // // Copyright (c) 2014 Antonio J. Nebro, Juan J. Durillo // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU Lesser General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU Lesser General Public License for more details. // // You should have received a copy of the GNU Lesser General Public License // along with this program. If not, see <http://www.gnu.org/licenses/>. package org.uma.jmetal.problem.multiobjective; import org.uma.jmetal.problem.impl.AbstractDoubleProblem; import org.uma.jmetal.solution.DoubleSolution; import java.util.ArrayList; import java.util.List; /** Class representing problem Fonseca */ @SuppressWarnings("serial") public class Fonseca extends AbstractDoubleProblem { /** Constructor */ public Fonseca() { setNumberOfVariables(3); setNumberOfObjectives(2); setNumberOfConstraints(0); setName("Fonseca"); List<Double> lowerLimit = new ArrayList<>(getNumberOfVariables()) ; List<Double> upperLimit = new ArrayList<>(getNumberOfVariables()) ; for (int i = 0; i < getNumberOfVariables(); i++) { lowerLimit.add(-4.0); upperLimit.add(4.0); } setLowerLimit(lowerLimit); setUpperLimit(upperLimit); } /** Evaluate() method */ @Override public void evaluate(DoubleSolution solution) { int numberOfVariables = getNumberOfVariables() ; double[] f = new double[getNumberOfObjectives()]; double[] x = new double[numberOfVariables] ; for (int i = 0; i < numberOfVariables; i++) { x[i] = solution.getVariableValue(i) ; } double sum1 = 0.0; for (int i = 0; i < numberOfVariables; i++) { sum1 += StrictMath.pow(x[i] - (1.0 / StrictMath.sqrt((double) numberOfVariables)), 2.0); } double exp1 = StrictMath.exp((-1.0) * sum1); f[0] = 1 - exp1; double sum2 = 0.0; for (int i = 0; i < numberOfVariables; i++) { sum2 += StrictMath.pow(x[i] + (1.0 / StrictMath.sqrt((double) numberOfVariables)), 2.0); } double exp2 = StrictMath.exp((-1.0) * sum2); f[1] = 1 - exp2; solution.setObjective(0, f[0]); solution.setObjective(1, f[1]); } }