source: branches/HeuristicLab.Problems.MultiObjectiveTestFunctions/HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Testfunctions/Misc/SchafferN1.cs @ 14069

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

#1087: Moved Pareto fronts to subfolders in the according test functions folder and changed PFStore.

File size: 2.9 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("SchafferN1", "Schaffer function N.1 for mulitobjective optimization from // https://en.wikipedia.org/wiki/Test_functions_for_optimization [30.11.2015]")]
30  [StorableClass]
31  public class SchafferN1 : MultiObjectiveTestFunction {
32    protected override double[,] GetBounds(int objectives) {
33      return new double[,] { { -1e5, 1e5 } };
34    }
35
36    protected override bool[] GetMaximization(int objectives) {
37      return new bool[2];
38    }
39
40    protected override double[] GetReferencePoint(int objectives) {
41      return new double[] { 1e5, 1e5 };
42    }
43
44
45    protected override IEnumerable<double[]> GetOptimalParetoFront(int objectives) {
46      return ParetoFrontStore.GetParetoFront("Misc.ParetoFronts." + "SchafferN1");
47    }
48
49    protected override double GetBestKnownHypervolume(int objectives) {
50      return Hypervolume.Calculate(GetOptimalParetoFront(objectives), GetReferencePoint(objectives), GetMaximization(objectives));
51    }
52
53    [StorableConstructor]
54    protected SchafferN1(bool deserializing) : base(deserializing) { }
55    protected SchafferN1(SchafferN1 original, Cloner cloner) : base(original, cloner) { }
56    public override IDeepCloneable Clone(Cloner cloner) {
57      return new SchafferN1(this, cloner);
58    }
59
60    public SchafferN1() : base(minimumObjectives: 2, maximumObjectives: 2, minimumSolutionLength: 1, maximumSolutionLength: 1) { }
61
62    public override double[] Evaluate(RealVector r, int objectives) {
63      if (objectives != 2) throw new ArgumentException("The Schaffer N1 problem must always have 2 objectives");
64      if (r.Length != 1) return null;
65      double x = r[0];
66
67      //objective1
68      double f0 = x * x;
69
70      //objective0
71      double f1 = x - 2;
72      f1 *= f1;
73
74      return new double[] { f0, f1 };
75    }
76  }
77}
Note: See TracBrowser for help on using the repository browser.