source: branches/2520_PersistenceReintegration/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ3.cs @ 16453

Last change on this file since 16453 was 16453, checked in by jkarder, 2 years ago

#2520: updated year of copyrights

File size: 2.6 KB
Line 
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
21using System;
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Encodings.RealVectorEncoding;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26
27namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
28  [Item("DTLZ3", "Testfunction as defined as DTLZ3 in http://repository.ias.ac.in/81671/ [30.11.15]")]
29  [StorableClass]
30  public class DTLZ3 : DTLZ {
31    protected override double GetBestKnownHypervolume(int objectives) {
32      if (objectives == 2) return 121.0 - 1.0 / 4.0 * Math.PI;
33      return -1;
34    }
35
36    [StorableConstructor]
37    protected DTLZ3(bool deserializing) : base(deserializing) { }
38    protected DTLZ3(DTLZ3 original, Cloner cloner) : base(original, cloner) { }
39    public DTLZ3() : base() { }
40
41    public override IDeepCloneable Clone(Cloner cloner) {
42      return new DTLZ3(this, cloner);
43    }
44
45    public override double[] Evaluate(RealVector r, int objectives) {
46      if (r.Length < objectives) {
47        throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
48      }
49      double[] res = new double[objectives];
50
51      //calculate g(Xm)
52      double sum = 0;
53      int length = r.Length - objectives + 1;
54      for (int i = r.Length - length; i < r.Length; i++) {
55        double d = r[i] - 0.5;
56        sum += d * d - Math.Cos(20 * Math.PI * d);
57      }
58      double g = 100 * (length + sum);
59
60      //calculating f0...fM-1
61      for (int i = 0; i < objectives; i++) {
62        double f = i == 0 ? 1 : (Math.Sin(r[objectives - i - 1] * Math.PI / 2)) * (1 + g);
63        for (int j = 0; j < objectives - i - 1; j++) {
64          f *= Math.Cos(r[j] * Math.PI / 2);
65        }
66        res[i] = f;
67      }
68      return res;
69    }
70  }
71}
Note: See TracBrowser for help on using the repository browser.