[13672] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17181] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13672] | 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
|
---|
[14044] | 21 |
|
---|
| 22 | using System.Linq;
|
---|
[13672] | 23 | using HeuristicLab.Common;
|
---|
[13725] | 24 | using HeuristicLab.Core;
|
---|
[13672] | 25 | using HeuristicLab.Data;
|
---|
| 26 | using HeuristicLab.Optimization;
|
---|
[14085] | 27 | using HeuristicLab.Parameters;
|
---|
[17097] | 28 | using HEAL.Attic;
|
---|
[13672] | 29 |
|
---|
[14111] | 30 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
[17097] | 31 | [StorableType("F06FB45C-051E-4AD8-BD82-16DA9DCBCACB")]
|
---|
[13725] | 32 | [Item("CrowdingAnalyzer", "The mean crowding distance for each point of the Front (see Multi-Objective Performance Metrics - Shodhganga for more information)")]
|
---|
| 33 | public class CrowdingAnalyzer : MOTFAnalyzer {
|
---|
[14044] | 34 |
|
---|
[14085] | 35 | public ILookupParameter<DoubleMatrix> BoundsParameter {
|
---|
| 36 | get { return (ILookupParameter<DoubleMatrix>)Parameters["Bounds"]; }
|
---|
| 37 | }
|
---|
| 38 |
|
---|
[14097] | 39 | public IResultParameter<DoubleValue> CrowdingResultParameter {
|
---|
| 40 | get { return (IResultParameter<DoubleValue>)Parameters["Crowding"]; }
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[13725] | 43 | [StorableConstructor]
|
---|
[17097] | 44 | protected CrowdingAnalyzer(StorableConstructorFlag _) : base(_) { }
|
---|
[14044] | 45 | public CrowdingAnalyzer(CrowdingAnalyzer original, Cloner cloner)
|
---|
| 46 | : base(original, cloner) {
|
---|
[13725] | 47 | }
|
---|
[13672] | 48 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 49 | return new CrowdingAnalyzer(this, cloner);
|
---|
| 50 | }
|
---|
[13725] | 51 |
|
---|
[14085] | 52 | public CrowdingAnalyzer() {
|
---|
| 53 | Parameters.Add(new LookupParameter<DoubleMatrix>("Bounds",
|
---|
| 54 | "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."));
|
---|
[14097] | 55 | Parameters.Add(new ResultParameter<DoubleValue>("Crowding", "The average corwding value of all points (excluding infinities)"));
|
---|
| 56 | CrowdingResultParameter.DefaultValue = new DoubleValue(double.NaN);
|
---|
| 57 |
|
---|
[14085] | 58 | }
|
---|
[13725] | 59 |
|
---|
[14044] | 60 | public override IOperation Apply() {
|
---|
| 61 | var qualities = QualitiesParameter.ActualValue;
|
---|
[14085] | 62 | var bounds = BoundsParameter.ActualValue;
|
---|
[13725] | 63 |
|
---|
[14085] | 64 | var crowdingDistance = Crowding.Calculate(qualities.Select(x => x.ToArray()), bounds.CloneAsMatrix());
|
---|
[14097] | 65 | CrowdingResultParameter.ActualValue.Value = crowdingDistance;
|
---|
[14044] | 66 |
|
---|
| 67 | return base.Apply();
|
---|
[13672] | 68 | }
|
---|
[14044] | 69 |
|
---|
[13672] | 70 | }
|
---|
| 71 | }
|
---|