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

Last change on this file since 14068 was 14068, checked in by mkommend, 5 years ago

#1087: Added checks for min and max objectives to testfunctions.

File size: 3.0 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    protected override double[,] GetBounds(int objectives) {
33      return new double[,] { { -5, 5 } };
34    }
35
36    protected override bool[] GetMaximization(int objecitves) {
37      return new bool[2];
38    }
39
40    protected override IEnumerable<double[]> GetOptimalParetoFront(int objecitves) {
41      return PFStore.get(this.ItemName);
42    }
43
44    protected override double GetBestKnownHypervolume(int objectives) {
45      return Hypervolume.Calculate(GetOptimalParetoFront(objectives), GetReferencePoint(objectives), GetMaximization(objectives));
46    }
47
48    protected override double[] GetReferencePoint(int objectives) {
49      return new double[] { 11, 11 };
50    }
51
52    [StorableConstructor]
53    protected Kursawe(bool deserializing) : base(deserializing) { }
54    protected Kursawe(Kursawe original, Cloner cloner) : base(original, cloner) { }
55    public override IDeepCloneable Clone(Cloner cloner) {
56      return new Kursawe(this, cloner);
57    }
58    public Kursawe() : base(minimumObjectives: 2, maximumObjectives: 2, minimumSolutionLength: 3, maximumSolutionLength: int.MaxValue) { }
59
60
61
62
63
64    public override double[] Evaluate(RealVector r, int objectives) {
65      if (objectives != 2) throw new ArgumentException("The Kursawe problem must always have 2 objectives");
66      //objective 1
67      double f0 = 0.0;
68      for (int i = 0; i < r.Length - 1; i++) {
69        f0 += -10 * Math.Exp(-0.2 * Math.Sqrt(r[i] * r[i] + r[i + 1] * r[i + 1]));
70      }
71      //objective2
72      double f1 = 0.0;
73      for (int i = 0; i < r.Length; i++) {
74        f1 += Math.Pow(Math.Abs(r[i]), 0.8) + 5 * Math.Sin(Math.Pow(r[i], 3));
75      }
76
77      return new double[] { f0, f1 };
78    }
79  }
80}
Note: See TracBrowser for help on using the repository browser.