Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.Problems.MultiObjectiveTestFunctions/HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Testfunctions/Kursawe.cs @ 13771

Last change on this file since 13771 was 13771, checked in by bwerth, 8 years ago

#1087 bugfix + additional relative HV calculation added

File size: 3.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 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.MultiObjectiveTestFunctions {
29  [Item("Kursawe", "Kursawe function from // http://darwin.di.uminho.pt/jecoli/index.php/Multiobjective_example [30.11.2015]")]
30  [StorableClass]
31  public class Kursawe : MultiObjectiveTestFunction {
32
33    public override double[,] Bounds(int objectives) {
34      return new double[,] { { -5, 5 } };
35    }
36
37    public override bool[] Maximization(int objecitves) {
38      return new bool[2];
39    }
40
41    public override int MinimumObjectives {
42      get { return 2; }
43    }
44    public override int MaximumObjectives {
45      get { return 2; }
46    }
47
48    public override int MinimumSolutionLength {
49      get { return 3; }
50    }
51    public override int MaximumSolutionLength {
52      get { return int.MaxValue; }
53    }
54
55    public override IEnumerable<double[]> OptimalParetoFront(int objecitves) {
56      return PFStore.get(this.ItemName);
57    }
58    public override double BestKnownHypervolume(int objectives) {
59      return Hypervolume.Calculate(OptimalParetoFront(objectives), ReferencePoint(objectives), Maximization(objectives));
60    }
61    public override double[] ReferencePoint(int objectives) {
62      return new double[] { 11, 11 };
63    }
64
65    [StorableConstructor]
66    protected Kursawe(bool deserializing) : base(deserializing) { }
67    protected Kursawe(Kursawe original, Cloner cloner) : base(original, cloner) { }
68    public override IDeepCloneable Clone(Cloner cloner) {
69      return new Kursawe(this, cloner);
70    }
71    public Kursawe() : base(minimumObjectives: 2, maximumObjectives: 2, minimumSolutionLength: 3) { }
72
73
74
75
76
77    public override double[] Evaluate(RealVector r, int objectives) {
78      if (objectives != 2) throw new ArgumentException("The Kursawe problem must always have 2 objectives");
79      //objective 1
80      double f0 = 0.0;
81      for (int i = 0; i < r.Length - 1; i++) {
82        f0 += -10 * Math.Exp(-0.2 * Math.Sqrt(r[i] * r[i] + r[i + 1] * r[i + 1]));
83      }
84      //objective2
85      double f1 = 0.0;
86      for (int i = 0; i < r.Length; i++) {
87        f1 += Math.Pow(Math.Abs(r[i]), 0.8) + 5 * Math.Sin(Math.Pow(r[i], 3));
88      }
89
90      return new double[] { f0, f1 };
91    }
92  }
93}
Note: See TracBrowser for help on using the repository browser.