Line  

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.Collections.Generic;


22 


23  namespace HeuristicLab.Problems.TestFunctions.MultiObjective {


24 


25  /// <summary>


26  /// The inverted generational Distance is defined as the mean of a all d[i]^(1/p),


27  /// where d[i] is the minimal distance the ith point of the optimal pareto front has to any point in the evaluated front.


28  /// </summary>


29  public static class InvertedGenerationalDistance {


30  public static double Calculate(IEnumerable<double[]> front, IEnumerable<double[]> optimalFront, double p) {


31  return GenerationalDistance.Calculate(optimalFront, front, p);


32  }


33  }


34  }


Note: See
TracBrowser
for help on using the repository browser.