source: branches/histogram/HeuristicLab.Analysis/3.3/QualityAnalysis/BestAverageWorstQualityCalculator.cs @ 6055

Last change on this file since 6055 was 6055, checked in by abeham, 8 years ago

#1465

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