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 


22  using System.Linq;


23  using HeuristicLab.Common;


24  using HeuristicLab.Core;


25  using HeuristicLab.Data;


26  using HeuristicLab.Optimization;


27  using HeuristicLab.Parameters;


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


29 


30  namespace HeuristicLab.Problems.MultiObjectiveTestFunctions {


31  [StorableClass]


32  [Item("CrowdingAnalyzer", "The mean crowding distance for each point of the Front (see MultiObjective Performance Metrics  Shodhganga for more information)")]


33  public class CrowdingAnalyzer : MOTFAnalyzer {


34 


35  public ILookupParameter<DoubleMatrix> BoundsParameter {


36  get { return (ILookupParameter<DoubleMatrix>)Parameters["Bounds"]; }


37  }


38 


39  [StorableConstructor]


40  protected CrowdingAnalyzer(bool deserializing) : base(deserializing) { }


41  public CrowdingAnalyzer(CrowdingAnalyzer original, Cloner cloner)


42  : base(original, cloner) {


43  }


44  public override IDeepCloneable Clone(Cloner cloner) {


45  return new CrowdingAnalyzer(this, cloner);


46  }


47 


48  public CrowdingAnalyzer() {


49  Parameters.Add(new LookupParameter<DoubleMatrix>("Bounds",


50  "The bounds of the solution given as either one line for all variables or a line for each variable. The first column specifies lower bound, the second upper bound."));


51  }


52 


53  public override IOperation Apply() {


54  var results = ResultsParameter.ActualValue;


55  var qualities = QualitiesParameter.ActualValue;


56  var bounds = BoundsParameter.ActualValue;


57 


58  if (!results.ContainsKey("Crowding")) results.Add(new Result("Crowding", new DoubleValue()));


59  var resultValue = (DoubleValue)results["Crowding"].Value;


60 


61  var crowdingDistance = Crowding.Calculate(qualities.Select(x => x.ToArray()), bounds.CloneAsMatrix());


62  resultValue.Value = crowdingDistance;


63 


64  return base.Apply();


65  }


66 


67  }


68  }

