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