1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
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;
|
---|
22 | using HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
25 | using HEAL.Attic;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
28 | [Item("DTLZ6", "Testfunction as defined as DTLZ5 in http://repository.ias.ac.in/81671/ [30.11.15]")]
|
---|
29 | [StorableType("5C92E344-A85F-4FAE-B7C3-2D188D60B049")]
|
---|
30 | public class DTLZ6 : DTLZ {
|
---|
31 |
|
---|
32 | [StorableConstructor]
|
---|
33 | protected DTLZ6(StorableConstructorFlag _) : base(_) { }
|
---|
34 | protected DTLZ6(DTLZ6 original, Cloner cloner) : base(original, cloner) { }
|
---|
35 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
36 | return new DTLZ6(this, cloner);
|
---|
37 | }
|
---|
38 | public DTLZ6() : base() { }
|
---|
39 |
|
---|
40 | public override double[] Evaluate(RealVector r, int objectives) {
|
---|
41 | if (r.Length < objectives) {
|
---|
42 | throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
|
---|
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 | g += Math.Pow(r[i], 0.1);
|
---|
50 | }
|
---|
51 |
|
---|
52 | //phi definition
|
---|
53 | Func<double, double> phi;
|
---|
54 | phi = (double x) => { return Math.PI / (4 * (1 + g)) * (1 + 2 * g * x); };
|
---|
55 |
|
---|
56 | //calculating f0...fM-1
|
---|
57 | for (int i = 0; i < objectives; i++) {
|
---|
58 | double f = i == 0 ? 1 : (Math.Sin(phi(r[objectives - i - 1]) * Math.PI / 2)) * (1 + g);
|
---|
59 | for (int j = 0; j < objectives - i - 1; j++) {
|
---|
60 | f *= Math.Cos(phi(r[j]) * Math.PI / 2);
|
---|
61 | }
|
---|
62 | res[i] = f;
|
---|
63 | }
|
---|
64 | return res;
|
---|
65 | }
|
---|
66 | }
|
---|
67 | }
|
---|