Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/IHR/IHR.cs @ 16171

Last change on this file since 16171 was 16171, checked in by bwerth, 6 years ago

#2943 worked on MOBasicProblem - added Interfaces;reworked MOCalculators; several minor changes

File size: 3.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2018 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 System.Linq;
23using HeuristicLab.Common;
24using HeuristicLab.Encodings.RealVectorEncoding;
25using HeuristicLab.Optimization;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
29  [StorableClass]
30  public abstract class IHR : MultiObjectiveTestFunction {
31    protected override double[,] GetBounds(int objectives) {
32      return new double[,] { { -1, 1 } };
33    }
34
35    protected override bool[] GetMaximization(int objectives) {
36      return new bool[objectives];
37    }
38
39    protected override double[] GetReferencePoint(int objectives) {
40      var rp = new double[objectives];
41      for (var i = 0; i < objectives; i++) {
42        rp[i] = 11;
43      }
44      return rp;
45    }
46
47    [StorableConstructor]
48    protected IHR(bool deserializing) : base(deserializing) { }
49    protected IHR(IHR original, Cloner cloner) : base(original, cloner) { }
50    public IHR() : base(minimumObjectives: 2, maximumObjectives: 2, minimumSolutionLength: 2, maximumSolutionLength: int.MaxValue) { }
51
52    public override double[] Evaluate(RealVector r, int objectives) {
53      if (r.Length < objectives) {
54        throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
55      }
56      return new double[] { F1(r), F2(r) };
57    }
58    protected abstract double F1(RealVector y);
59    protected abstract double F2(RealVector y);
60    protected abstract double G(RealVector y);
61
62    protected override double GetBestKnownHypervolume(int objectives) {
63      return HypervolumeCalculator.CalculateHypervolume(GetOptimalParetoFront(objectives).ToArray(), GetReferencePoint(objectives), GetMaximization(objectives));
64    }
65
66    protected double H(double x, RealVector r) {
67      return 1.0 / (1 + Math.Exp(-x / Math.Sqrt(r.Length)));
68    }
69    protected double HF(double x, RealVector r) {
70      double ymax = 1;
71      return Math.Abs(r[0]) <= ymax ? x : 1 + Math.Abs(r[0]);
72    }
73    protected double HG(double x) {
74      return (x * x) / (Math.Abs(x) + 0.1);
75    }
76  }
77}
Note: See TracBrowser for help on using the repository browser.