[13672] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13672] | 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 | using System;
|
---|
[13620] | 22 | using HeuristicLab.Common;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
[16565] | 25 | using HEAL.Attic;
|
---|
[13620] | 26 |
|
---|
[14111] | 27 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
[13620] | 28 | [Item("DTLZ5", "Testfunction as defined as DTLZ5 in http://repository.ias.ac.in/81671/ [30.11.15]")]
|
---|
[16565] | 29 | [StorableType("CEFD068E-521B-459F-80F1-B2AE4D114D41")]
|
---|
[13620] | 30 | public class DTLZ5 : DTLZ {
|
---|
| 31 |
|
---|
| 32 | [StorableConstructor]
|
---|
[16565] | 33 | protected DTLZ5(StorableConstructorFlag _) : base(_) { }
|
---|
[13620] | 34 | protected DTLZ5(DTLZ5 original, Cloner cloner) : base(original, cloner) { }
|
---|
| 35 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 36 | return new DTLZ5(this, cloner);
|
---|
| 37 | }
|
---|
| 38 | public DTLZ5() : base() { }
|
---|
| 39 |
|
---|
| 40 | public override double[] Evaluate(RealVector r, int objectives) {
|
---|
| 41 | if (r.Length < objectives) {
|
---|
[13725] | 42 | throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
|
---|
[13620] | 43 | }
|
---|
| 44 | double[] res = new double[objectives];
|
---|
| 45 |
|
---|
| 46 | //calculate g(Xm)
|
---|
| 47 | double g = 0;
|
---|
| 48 | for (int i = objectives; i < r.Length; i++) {
|
---|
| 49 | double d = r[i] - 0.5;
|
---|
[13672] | 50 | g += d * d;
|
---|
[13620] | 51 | }
|
---|
| 52 |
|
---|
| 53 | //phi definition
|
---|
| 54 | Func<double, double> phi;
|
---|
| 55 | phi = (double x) => { return Math.PI / (4 * (1 + g)) * (1 + 2 * g * x); };
|
---|
| 56 |
|
---|
| 57 | //calculating f0...fM-1
|
---|
| 58 | for (int i = 0; i < objectives; i++) {
|
---|
| 59 | double f = i == 0 ? 1 : (Math.Sin(phi(r[objectives - i - 1]) * Math.PI / 2)) * (1 + g);
|
---|
| 60 | for (int j = 0; j < objectives - i - 1; j++) {
|
---|
| 61 | f *= Math.Cos(phi(r[j]) * Math.PI / 2);
|
---|
| 62 | }
|
---|
| 63 | res[i] = f;
|
---|
| 64 | }
|
---|
| 65 | return res;
|
---|
| 66 | }
|
---|
| 67 | }
|
---|
| 68 | }
|
---|