1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022019 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 HeuristicLab.Common;


23  using HeuristicLab.Encodings.RealVectorEncoding;


24  using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;


25 


26  namespace HeuristicLab.Problems.TestFunctions.MultiObjective {


27  [StorableClass]


28  public abstract class IHR : MultiObjectiveTestFunction {


29  protected override double[,] GetBounds(int objectives) {


30  return new double[,] { { 1, 1 } };


31  }


32 


33  protected override bool[] GetMaximization(int objectives) {


34  return new bool[objectives];


35  }


36 


37  protected override double[] GetReferencePoint(int objectives) {


38  double[] rp = new double[objectives];


39  for (int i = 0; i < objectives; i++) {


40  rp[i] = 11;


41  }


42  return rp;


43  }


44 


45  [StorableConstructor]


46  protected IHR(bool deserializing) : base(deserializing) { }


47  protected IHR(IHR original, Cloner cloner) : base(original, cloner) { }


48  public IHR() : base(minimumObjectives: 2, maximumObjectives: 2, minimumSolutionLength: 2, maximumSolutionLength: int.MaxValue) { }


49 


50  public override double[] Evaluate(RealVector r, int objectives) {


51  if (r.Length < objectives) {


52  throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");


53  }


54  return new double[] { F1(r), F2(r) };


55  }


56  protected abstract double F1(RealVector y);


57  protected abstract double F2(RealVector y);


58  protected abstract double G(RealVector y);


59 


60 


61  protected double H(double x, RealVector r) {


62  return 1.0 / (1 + Math.Exp(x / Math.Sqrt(r.Length)));


63  }


64  protected double HF(double x, RealVector r) {


65  double ymax = 1;


66  return Math.Abs(r[0]) <= ymax ? x : 1 + Math.Abs(r[0]);


67  }


68  protected double HG(double x) {


69  return (x * x) / (Math.Abs(x) + 0.1);


70  }


71  }


72  }

