?? cec2009_uf3.java
字號(hào):
/** * CEC2009_UF3.java * * @author Antonio J. Nebro * @version 1.0 */package jmetal.problems.cec2009Competition;import jmetal.base.*;import jmetal.base.Configuration.SolutionType_;import jmetal.base.Configuration.VariableType_;import jmetal.util.JMException;/** * Class representing problem CEC2009_UF3 */public class CEC2009_UF3 extends Problem { /** * Constructor. * Creates a default instance of problem CEC2009_UF3 (30 decision variables) * @param solutionType The solution type must "Real" or "BinaryReal". */ public CEC2009_UF3(String solutionType) { this(30, solutionType); // 30 variables by default } // CEC2009_UF1 /** * Creates a new instance of problem CEC2009_UF3. * @param numberOfVariables Number of variables. * @param solutionType The solution type must "Real" or "BinaryReal". */ public CEC2009_UF3(Integer numberOfVariables, String solutionType) { numberOfVariables_ = numberOfVariables.intValue(); numberOfObjectives_ = 2; numberOfConstraints_= 0; problemName_ = "CEC2009_UF3"; upperLimit_ = new double[numberOfVariables_]; lowerLimit_ = new double[numberOfVariables_]; // Establishes upper and lower limits for the variables for (int var = 0; var < numberOfVariables_; var++) { lowerLimit_[var] = 0.0; upperLimit_[var] = 1.0; } // for solutionType_ = Enum.valueOf(SolutionType_.class, solutionType) ; // All the variables are of the same type, so the solutionType name is the // same than the variableType name variableType_ = new VariableType_[numberOfVariables_]; for (int var = 0; var < numberOfVariables_; var++){ variableType_[var] = Enum.valueOf(VariableType_.class, solutionType) ; } // for } // CEC2009_UF3 /** * Evaluates a solution. * @param solution The solution to evaluate. * @throws JMException */ public void evaluate(Solution solution) throws JMException { DecisionVariables decisionVariables = solution.getDecisionVariables(); double [] x = new double[numberOfVariables_] ; for (int i = 0; i < numberOfVariables_; i++) x[i] = decisionVariables.variables_[i].getValue() ; int count1, count2; double sum1, sum2, prod1, prod2, yj, pj; sum1 = sum2 = 0.0; count1 = count2 = 0; prod1 = prod2 = 1.0; for (int j = 2 ; j <= numberOfVariables_; j++) { yj = x[j-1]-Math.pow(x[0],0.5*(1.0+3.0*(j-2.0)/(numberOfVariables_-2.0))); pj = Math.cos(20.0*yj*Math.PI/Math.sqrt(j+0.0)); if (j % 2 == 0) { sum2 += yj*yj; prod2 *= pj; count2++; } else { sum1 += yj*yj; prod1 *= pj; count1++; } } solution.setObjective(0, x[0] + 2.0*(4.0*sum1 - 2.0*prod1 + 2.0) / (double)count1); solution.setObjective(1, 1.0 - Math.sqrt(x[0]) + 2.0*(4.0*sum2 - 2.0*prod2 + 2.0) / (double)count2); } // evaluate} // CEC2009_UF3
?? 快捷鍵說(shuō)明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號(hào)
Ctrl + =
減小字號(hào)
Ctrl + -