1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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 HeuristicLab.Common;
|
---|
22 | using HeuristicLab.Core;
|
---|
23 | using HeuristicLab.Data;
|
---|
24 | using HeuristicLab.Optimization;
|
---|
25 | using HeuristicLab.Parameters;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Problems.MultiObjectiveTestFunctions {
|
---|
29 | [StorableClass]
|
---|
30 | [Item("GenerationalDistanceAnalyzer", "The generational distance between the current and the best known front (see Multi-Objective Performance Metrics - Shodhganga for more information)")]
|
---|
31 | public class GenerationalDistanceAnalyzer : MOTFAnalyzer {
|
---|
32 | [StorableHook(HookType.AfterDeserialization)]
|
---|
33 | private void AfterDeserialization() {
|
---|
34 | }
|
---|
35 | [StorableConstructor]
|
---|
36 | protected GenerationalDistanceAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
37 | public GenerationalDistanceAnalyzer(GenerationalDistanceAnalyzer original, Cloner cloner) : base(original, cloner) {
|
---|
38 | }
|
---|
39 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
40 | return new GenerationalDistanceAnalyzer(this, cloner);
|
---|
41 | }
|
---|
42 |
|
---|
43 | /// <summary>
|
---|
44 | /// </summary>
|
---|
45 | private IValueParameter<DoubleValue> DampeningParameter {
|
---|
46 | get {
|
---|
47 | return (IValueParameter<DoubleValue>)Parameters["Dampening"];
|
---|
48 | }
|
---|
49 | set {
|
---|
50 | Parameters["Dampening"].ActualValue = value;
|
---|
51 | }
|
---|
52 | }
|
---|
53 |
|
---|
54 | public GenerationalDistanceAnalyzer() {
|
---|
55 | Parameters.Add(new ValueParameter<DoubleValue>("Dampening", "", new DoubleValue(1)));
|
---|
56 | }
|
---|
57 |
|
---|
58 | public override void Analyze(Individual[] individuals, double[][] qualities, ResultCollection results) {
|
---|
59 | int objectives = qualities[0].Length;
|
---|
60 | var optimalfront = TestFunctionParameter.ActualValue.OptimalParetoFront(objectives);
|
---|
61 | if (optimalfront == null) return;
|
---|
62 | if (!results.ContainsKey("GenerationalDistance")) results.Add(new Result("GenerationalDistance", typeof(DoubleValue)));
|
---|
63 | results["GenerationalDistance"].Value = new DoubleValue(GenerationalDistance.Calculate(qualities, optimalfront, DampeningParameter.Value.Value));
|
---|
64 | }
|
---|
65 | }
|
---|
66 | }
|
---|