1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2018 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;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 | using HeuristicLab.Parameters;
|
---|
29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
32 | [StorableClass]
|
---|
33 | [Item("GenerationalDistanceAnalyzer", "The generational distance between the current and the best known front (see Multi-Objective Performance Metrics - Shodhganga for more information)")]
|
---|
34 | public class GenerationalDistanceAnalyzer : MOTFAnalyzer {
|
---|
35 |
|
---|
36 | private IFixedValueParameter<DoubleValue> DampeningParameter {
|
---|
37 | get { return (IFixedValueParameter<DoubleValue>)Parameters["Dampening"]; }
|
---|
38 | set { Parameters["Dampening"].ActualValue = value; }
|
---|
39 | }
|
---|
40 |
|
---|
41 | public double Dampening {
|
---|
42 | get { return DampeningParameter.Value.Value; }
|
---|
43 | set { DampeningParameter.Value.Value = value; }
|
---|
44 | }
|
---|
45 |
|
---|
46 | public IResultParameter<DoubleValue> GenerationalDistanceResultParameter {
|
---|
47 | get { return (IResultParameter<DoubleValue>)Parameters["Generational Distance"]; }
|
---|
48 | }
|
---|
49 |
|
---|
50 | [StorableConstructor]
|
---|
51 | protected GenerationalDistanceAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
52 | protected GenerationalDistanceAnalyzer(GenerationalDistanceAnalyzer original, Cloner cloner) : base(original, cloner) { }
|
---|
53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
54 | return new GenerationalDistanceAnalyzer(this, cloner);
|
---|
55 | }
|
---|
56 |
|
---|
57 | public GenerationalDistanceAnalyzer() {
|
---|
58 | Parameters.Add(new FixedValueParameter<DoubleValue>("Dampening", "", new DoubleValue(1)));
|
---|
59 | Parameters.Add(new ResultParameter<DoubleValue>("Generational Distance", "The genrational distance between the current front and the optimal front"));
|
---|
60 | GenerationalDistanceResultParameter.DefaultValue = new DoubleValue(double.NaN);
|
---|
61 |
|
---|
62 | }
|
---|
63 |
|
---|
64 | public override IOperation Apply() {
|
---|
65 | var qualities = QualitiesParameter.ActualValue;
|
---|
66 | int objectives = qualities[0].Length;
|
---|
67 |
|
---|
68 | var optimalfront = TestFunctionParameter.ActualValue.OptimalParetoFront(objectives);
|
---|
69 | if (optimalfront == null) return base.Apply();
|
---|
70 |
|
---|
71 | var distance = GenerationalDistance.Calculate(qualities.Select(x => x.CloneAsArray()), optimalfront, Dampening);
|
---|
72 | GenerationalDistanceResultParameter.ActualValue.Value = distance;
|
---|
73 |
|
---|
74 | return base.Apply();
|
---|
75 | }
|
---|
76 | }
|
---|
77 | }
|
---|