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
|
---|
21 | using System;
|
---|
22 | using System.Collections.Generic;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
26 | using HEAL.Attic;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
29 | [Item("IHR4", "Testfunction as defined as IHR4 in \"Igel, C., Hansen, N., & Roth, S. (2007). Covariance matrix adaptation for multi-objective optimization. Evolutionary computation, 15(1), 1-28.\" [24.06.16]")]
|
---|
30 | [StorableType("E83A9E6E-F7B3-4B27-B5CA-A323D89844F5")]
|
---|
31 | public class IHR4 : IHR {
|
---|
32 | protected override IEnumerable<double[]> GetOptimalParetoFront(int objectives) {
|
---|
33 | List<double[]> res = new List<double[]>();
|
---|
34 | for (int i = 0; i <= 500; i++) {
|
---|
35 | RealVector r = new RealVector(objectives);
|
---|
36 | r[0] = 1 / 500.0 * i;
|
---|
37 | res.Add(this.Evaluate(r, objectives));
|
---|
38 | }
|
---|
39 | return res;
|
---|
40 | }
|
---|
41 |
|
---|
42 | protected override double GetBestKnownHypervolume(int objectives) {
|
---|
43 | return Hypervolume.Calculate(GetOptimalParetoFront(objectives), GetReferencePoint(objectives), GetMaximization(objectives));
|
---|
44 | }
|
---|
45 |
|
---|
46 | protected override double[,] GetBounds(int objectives) {
|
---|
47 | return new double[,] { { -5, 5 } };
|
---|
48 | }
|
---|
49 |
|
---|
50 | [StorableConstructor]
|
---|
51 | protected IHR4(StorableConstructorFlag _) : base(_) { }
|
---|
52 | protected IHR4(IHR4 original, Cloner cloner) : base(original, cloner) { }
|
---|
53 | public IHR4() : base() {
|
---|
54 | }
|
---|
55 |
|
---|
56 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
57 | return new IHR4(this, cloner);
|
---|
58 | }
|
---|
59 |
|
---|
60 | protected override double F1(RealVector y) {
|
---|
61 | return Math.Abs(y[0]);
|
---|
62 | }
|
---|
63 |
|
---|
64 | protected override double F2(RealVector y) {
|
---|
65 | var g = G(y);
|
---|
66 | var d = H(y[0], y) / g;
|
---|
67 | return g * HF(1 - Math.Sqrt(d), y);
|
---|
68 | }
|
---|
69 |
|
---|
70 | protected override double G(RealVector y) {
|
---|
71 | double sum = 0.0;
|
---|
72 | for (int i = 1; i < y.Length; i++) {
|
---|
73 | sum += y[i] * y[i] - 10 * Math.Cos(4 * Math.PI * y[i]);
|
---|
74 | }
|
---|
75 | return 1 + 10 * (y.Length - 1) + sum;
|
---|
76 | }
|
---|
77 | }
|
---|
78 | }
|
---|