source: branches/2520_PersistenceReintegration/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/Misc/ELLI1.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: 3.2 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 System.Collections.Generic;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Encodings.RealVectorEncoding;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
29  [Item("ELLI", "to be aded")]
30  [StorableClass]
31  public class ELLI : MultiObjectiveTestFunction {
32    protected override double[,] GetBounds(int objectives) {
33      return new double[,] { { -10, 10 } };
34    }
35
36    protected override bool[] GetMaximization(int objecitves) {
37      return new bool[2];
38    }
39
40    protected override double[] GetReferencePoint(int objecitves) {
41      return new double[] { 11, 11 };
42    }
43
44    protected override IEnumerable<double[]> GetOptimalParetoFront(int objecitves) {
45      List<double[]> res = new List<double[]>();
46      for (int i = 0; i <= 500; i++) {
47        RealVector r = new RealVector(2);
48        r[0] = 2 / 500.0 * i;
49        r[1] = 2 / 500.0 * i;
50        res.Add(this.Evaluate(r, 2));
51      }
52      return res;
53    }
54
55    protected override double GetBestKnownHypervolume(int objectives) {
56      return Hypervolume.Calculate(GetOptimalParetoFront(objectives), GetReferencePoint(objectives), GetMaximization(objectives));
57    }
58
59    [StorableConstructor]
60    protected ELLI(bool deserializing) : base(deserializing) { }
61    protected ELLI(ELLI original, Cloner cloner) : base(original, cloner) { }
62    public override IDeepCloneable Clone(Cloner cloner) {
63      return new ELLI(this, cloner);
64    }
65
66    public ELLI() : base(minimumObjectives: 2, maximumObjectives: 2, minimumSolutionLength: 1, maximumSolutionLength: int.MaxValue) { }
67
68    public override double[] Evaluate(RealVector r, int objectives) {
69      if (objectives != 2) throw new ArgumentException("The ELLI problem must always have 2 objectives");
70      double a = 1000;
71      double sum = 0.0;
72      for (int i = 0; i < r.Length; i++) {
73        sum += Math.Pow(a, 2 * i / (r.Length - 1)) * r[i] * r[i];
74      }
75
76      //objective1
77      double f0 = 1 / (a * a * r.Length) * sum;
78
79      sum = 0.0;
80      for (int i = 0; i < r.Length; i++) {
81        sum += Math.Pow(a, 2 * i / (r.Length - 1)) * (r[i] - 2) * (r[i] - 2);
82      }
83      //objective0
84      double f1 = 1 / (a * a * r.Length) * sum;
85
86      return new double[] { f0, f1 };
87    }
88  }
89}
Note: See TracBrowser for help on using the repository browser.