MOEAFramework-2.11.src.org.moeaframework.problem.BBOB2016.AttractiveSector Maven / Gradle / Ivy
/* Copyright 2009-2016 David Hadka
*
* This file is part of the MOEA Framework.
*
* The MOEA Framework 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.
*
* The MOEA Framework 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 the MOEA Framework. If not, see .
*/
package org.moeaframework.problem.BBOB2016;
import org.moeaframework.core.Solution;
import org.moeaframework.core.variable.EncodingUtils;
/*
* The following source code is derived from the Coco Framework available at
* under the 3-clause BSD license. The
* original code is copyright 2013 by the NumBBO/CoCO team. See the AUTHORS
* file located in the Coco Framework repository for more details.
*/
/**
* The Attractive Sector function. It is not intended for this function to be
* used directly since the BBOB test suite applies additional transformations
* to the test functions.
*
* Properties:
*
* - Highly asymmetric
*
- Unimodal
*
- Low or moderate conditioning
*
*/
public class AttractiveSector extends BBOBFunction {
/**
* The location of the optimum.
*/
private final double[] xopt;
/**
* Constructs a new instance of the Attractive Sector functoin.
*
* @param numberOfVariables the number of decision variables
* @param xopt the location of the optimum
*/
public AttractiveSector(int numberOfVariables, double[] xopt) {
super(numberOfVariables);
this.xopt = xopt;
}
@Override
public void evaluate(Solution solution) {
double[] x = EncodingUtils.getReal(solution);
double result = 0.0;
for (int i = 0; i < x.length; i++) {
if (xopt[i] * x[i] > 0.0) {
result += 100.0 * 100.0 * x[i] * x[i];
} else {
result += x[i] * x[i];
}
}
solution.setObjective(0, result);
}
}