de.termininistic.serein.examples.benchmarks.functions.multimodal.RastriginFunction.java Source code

Introduction

Here is the source code for de.termininistic.serein.examples.benchmarks.functions.multimodal.RastriginFunction.java

Source

/**
 * Copyright (C) 2015 Tobias Uhlig (tobias.uhlig@unibw.de)
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *         http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package de.termininistic.serein.examples.benchmarks.functions.multimodal;

import org.apache.commons.math3.linear.ArrayRealVector;
import org.apache.commons.math3.linear.RealVector;

import de.termininistic.serein.examples.benchmarks.functions.BenchmarkFunction;
import de.termininistic.serein.examples.benchmarks.functions.Domain;

public class RastriginFunction implements BenchmarkFunction {
    public final static Domain DEFAULT_DOMAIN = new Domain(-5.12, 5.12);
    private final Domain domain;

    public RastriginFunction() {
        this(DEFAULT_DOMAIN);
    }

    public RastriginFunction(Domain domain) {
        this.domain = domain;
    }

    public static void main(String[] args) {
        AckleyFunction f = new AckleyFunction();
        RealVector v = new ArrayRealVector(3, 0.0);
        System.out.println(f.map(v));

    }

    @Override
    public Domain getDomain() {
        return domain;
    }

    @Override
    public RealVector getOptimum(int dimension) {
        return new ArrayRealVector(dimension, 0.0);
    }

    @Override
    public double map(RealVector v) {
        double fx = Double.NaN;
        double[] x = v.toArray();
        int n = x.length;
        fx = 10 * n;
        for (int i = 0; i < n; i++) {
            fx += x[i] * x[i] - 10 * Math.cos(2 * Math.PI * x[i]);
        }
        return fx;
    }

}