1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022016 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.Encodings.RealVectorEncoding;


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


26 


27  namespace HeuristicLab.Problems.MultiObjectiveTestFunctions {


28  [StorableClass]


29  public abstract class IHR : MultiObjectiveTestFunction {


30  protected override IEnumerable<double[]> GetOptimalParetoFront(int objectives) {


31  if (objectives == 2) return PFStore.get(this.ItemName + ".2D");


32  return null;


33  }


34 


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


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


37  }


38 


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


40  return new bool[objectives];


41  }


42 


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


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


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


46  rp[i] = 11;


47  }


48  return rp;


49  }


50 


51  [StorableConstructor]


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


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


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


55 


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


57  if (r.Length < objectives) {


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


59  }


60  RealVector y = Y(r);


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


62  }


63  protected abstract double F1(RealVector y);


64  protected abstract double F2(RealVector r, RealVector y);


65  protected abstract double G(RealVector y);


66 


67 


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


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


70  }


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


72  double ymax = 1;


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


74  }


75  protected double HG(double x) {


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


77  }


78  protected RealVector Y(RealVector x) {


79  return x;


80  }


81  }


82  }

