[13936] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17246] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13936] | 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;
|
---|
[16662] | 26 | using HEAL.Attic;
|
---|
[13936] | 27 |
|
---|
[14111] | 28 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
[13936] | 29 | [Item("IHR2", "Testfunction as defined as IHR2 in \"Igel, C., Hansen, N., & Roth, S. (2007). Covariance matrix adaptation for multi-objective optimization. Evolutionary computation, 15(1), 1-28.\" [24.06.16]")]
|
---|
[16662] | 30 | [StorableType("3E06E73F-61CD-4B99-99A8-84E6E9C0EFC9")]
|
---|
[13936] | 31 | public class IHR2 : IHR {
|
---|
[14068] | 32 | protected override IEnumerable<double[]> GetOptimalParetoFront(int objectives) {
|
---|
[13936] | 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 |
|
---|
| 38 | res.Add(this.Evaluate(r, objectives));
|
---|
| 39 | }
|
---|
| 40 | return res;
|
---|
| 41 | }
|
---|
[14068] | 42 |
|
---|
| 43 | protected override double GetBestKnownHypervolume(int objectives) {
|
---|
| 44 | return Hypervolume.Calculate(GetOptimalParetoFront(objectives), GetReferencePoint(objectives), GetMaximization(objectives));
|
---|
[13936] | 45 | }
|
---|
| 46 |
|
---|
| 47 | [StorableConstructor]
|
---|
[16662] | 48 | protected IHR2(StorableConstructorFlag _) : base(_) { }
|
---|
[13936] | 49 | protected IHR2(IHR2 original, Cloner cloner) : base(original, cloner) { }
|
---|
| 50 | public IHR2() : base() {
|
---|
| 51 | }
|
---|
| 52 |
|
---|
| 53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 54 | return new IHR2(this, cloner);
|
---|
| 55 | }
|
---|
| 56 |
|
---|
| 57 | protected override double F1(RealVector y) {
|
---|
| 58 | return Math.Abs(y[0]);
|
---|
| 59 | }
|
---|
| 60 |
|
---|
[14090] | 61 | protected override double F2(RealVector y) {
|
---|
[13936] | 62 | var g = G(y);
|
---|
| 63 | var d = H(y[0], y) / g;
|
---|
| 64 | return g * HF(1 - d * d, y);
|
---|
| 65 | }
|
---|
| 66 |
|
---|
| 67 | protected override double G(RealVector y) {
|
---|
| 68 | double sum = 0.0;
|
---|
| 69 | for (int i = 1; i < y.Length; i++) {
|
---|
| 70 | sum += HG(y[i]);
|
---|
| 71 | }
|
---|
| 72 | return 1 + 9 * sum / (y.Length - 1);
|
---|
| 73 | }
|
---|
| 74 | }
|
---|
| 75 | }
|
---|