source: branches/2520_PersistenceReintegration/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ1.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.5 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("DTLZ1", "Testfunction as defined as DTLZ1 in http://repository.ias.ac.in/81671/ [30.11.15]")]
29  [StorableClass]
30  public class DTLZ1 : DTLZ {
31    protected override double GetBestKnownHypervolume(int objectives) {
32      if (objectives == 2) return 120 + 7.0 / 8;
33      return -1;
34    }
35
36    [StorableConstructor]
37    protected DTLZ1(bool deserializing) : base(deserializing) { }
38    protected DTLZ1(DTLZ1 original, Cloner cloner) : base(original, cloner) { }
39    public DTLZ1() : base() {
40    }
41
42    public override IDeepCloneable Clone(Cloner cloner) {
43      return new DTLZ1(this, cloner);
44    }
45
46    public override double[] Evaluate(RealVector r, int objectives) {
47      if (r.Length < objectives) {
48        throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
49      }
50      double[] res = new double[objectives];
51      int k = r.Length - objectives + 1;
52      double g = 0;
53
54      for (int i = r.Length - k; i < r.Length; i++) {
55        g += (r[i] - 0.5) * (r[i] - 0.5) - Math.Cos(20.0 * Math.PI * (r[i] - 0.5));
56      };
57      g += k;
58      g *= 100;
59
60      for (int i = 0; i < objectives; i++) {
61        res[i] = 0.5 * (1.0 + g);
62        for (int j = 0; j < objectives - i - 1; ++j)
63          res[i] *= (r[j]);
64        if (i > 0)
65          res[i] *= 1 - r[objectives - i - 1];
66      }
67      return res;
68    }
69  }
70}
Note: See TracBrowser for help on using the repository browser.