source: branches/2839_HiveProjectManagement/HeuristicLab.Analysis/3.3/QualityAnalysis/BestAverageWorstQualityCalculator.cs @ 16057

Last change on this file since 16057 was 16057, checked in by jkarder, 15 months ago

#2839:

File size: 4.9 KB
Line 
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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Operators;
26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29
30namespace HeuristicLab.Analysis {
31  /// <summary>
32  /// An operator which calculates the best, average and worst quality of solutions in the scope tree.
33  /// </summary>
34  [Item("BestAverageWorstQualityCalculator", "An operator which calculates the best, average and worst quality of solutions in the scope tree.")]
35  [StorableClass]
36  public sealed class BestAverageWorstQualityCalculator : SingleSuccessorOperator, ISingleObjectiveOperator {
37    public ValueLookupParameter<BoolValue> MaximizationParameter {
38      get { return (ValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
39    }
40    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
41      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
42    }
43    public ValueLookupParameter<DoubleValue> BestQualityParameter {
44      get { return (ValueLookupParameter<DoubleValue>)Parameters["BestQuality"]; }
45    }
46    public ValueLookupParameter<DoubleValue> AverageQualityParameter {
47      get { return (ValueLookupParameter<DoubleValue>)Parameters["AverageQuality"]; }
48    }
49    public ValueLookupParameter<DoubleValue> WorstQualityParameter {
50      get { return (ValueLookupParameter<DoubleValue>)Parameters["WorstQuality"]; }
51    }
52
53    #region Storing & Cloning
54    [StorableConstructor]
55    private BestAverageWorstQualityCalculator(bool deserializing) : base(deserializing) { }
56    private BestAverageWorstQualityCalculator(BestAverageWorstQualityCalculator original, Cloner cloner) : base(original, cloner) { }
57    public override IDeepCloneable Clone(Cloner cloner) {
58      return new BestAverageWorstQualityCalculator(this, cloner);
59    }
60    #endregion
61    public BestAverageWorstQualityCalculator()
62      : base() {
63      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the current problem is a maximization problem, otherwise false."));
64      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value contained in the scope tree which represents the solution quality."));
65      Parameters.Add(new ValueLookupParameter<DoubleValue>("BestQuality", "The quality value of the best solution."));
66      Parameters.Add(new ValueLookupParameter<DoubleValue>("AverageQuality", "The average quality of all solutions."));
67      Parameters.Add(new ValueLookupParameter<DoubleValue>("WorstQuality", "The quality value of the worst solution."));
68
69      BestQualityParameter.Hidden = true;
70      AverageQualityParameter.Hidden = true;
71      WorstQualityParameter.Hidden = true;
72    }
73
74
75    public override IOperation Apply() {
76      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
77      bool maximization = MaximizationParameter.ActualValue.Value;
78
79      if (qualities.Length > 0) {
80        double min = double.MaxValue, max = double.MinValue, sum = 0.0;
81        for (int i = 0; i < qualities.Length; i++) {
82          if (qualities[i].Value < min) min = qualities[i].Value;
83          if (qualities[i].Value > max) max = qualities[i].Value;
84          sum += qualities[i].Value;
85        }
86        if (!maximization) {
87          double temp = min;
88          min = max;
89          max = temp;
90        }
91
92        DoubleValue best = BestQualityParameter.ActualValue;
93        if (best == null) BestQualityParameter.ActualValue = new DoubleValue(max);
94        else best.Value = max;
95        DoubleValue average = AverageQualityParameter.ActualValue;
96        if (average == null) AverageQualityParameter.ActualValue = new DoubleValue(sum / qualities.Length);
97        else average.Value = sum / qualities.Length;
98        DoubleValue worst = WorstQualityParameter.ActualValue;
99        if (worst == null) WorstQualityParameter.ActualValue = new DoubleValue(min);
100        else worst.Value = min;
101      }
102      return base.Apply();
103    }
104  }
105}
Note: See TracBrowser for help on using the repository browser.