Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Analysis/3.3/BestAverageWorstQualityCalculator.cs @ 3659

Last change on this file since 3659 was 3659, checked in by swagner, 14 years ago

Worked on refactoring of algorithm analysis and tracing (#999)

  • removed SubScopesSubScopesLookupParameter
  • adapted SubScopesLookupParameter and renamed it into ScopeTreeLookupParameter
File size: 4.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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 solution quality of the current population.
32  /// </summary>
33  [Item("BestAverageWorstQualityCalculator", "An operator which calculates the best, average and worst solution quality of the current population.")]
34  [StorableClass]
35  public sealed class BestAverageWorstQualityCalculator : SingleSuccessorOperator {
36    public IValueLookupParameter<BoolValue> MaximizationParameter {
37      get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
38    }
39    public ILookupParameter<ItemArray<DoubleValue>> QualityParameter {
40      get { return (ILookupParameter<ItemArray<DoubleValue>>)Parameters["Quality"]; }
41    }
42    public IValueLookupParameter<DoubleValue> BestQualityParameter {
43      get { return (IValueLookupParameter<DoubleValue>)Parameters["BestQuality"]; }
44    }
45    public IValueLookupParameter<DoubleValue> AverageQualityParameter {
46      get { return (IValueLookupParameter<DoubleValue>)Parameters["AverageQuality"]; }
47    }
48    public IValueLookupParameter<DoubleValue> WorstQualityParameter {
49      get { return (IValueLookupParameter<DoubleValue>)Parameters["WorstQuality"]; }
50    }
51
52    public BestAverageWorstQualityCalculator()
53      : base() {
54      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the current problem is a maximization problem, otherwise false."));
55      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value contained in each sub-scope which represents the solution quality."));
56      Parameters.Add(new ValueLookupParameter<DoubleValue>("BestQuality", "The quality value of the best solution."));
57      Parameters.Add(new ValueLookupParameter<DoubleValue>("AverageQuality", "The average quality of all solutions."));
58      Parameters.Add(new ValueLookupParameter<DoubleValue>("WorstQuality", "The quality value of the worst solution."));
59    }
60
61
62    public override IOperation Apply() {
63      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
64      bool maximization = MaximizationParameter.ActualValue.Value;
65
66      if (qualities.Length > 0) {
67        double min = double.MaxValue, max = double.MinValue, sum = 0.0;
68        for (int i = 0; i < qualities.Length; i++) {
69          if (qualities[i].Value < min) min = qualities[i].Value;
70          if (qualities[i].Value > max) max = qualities[i].Value;
71          sum += qualities[i].Value;
72        }
73        if (!maximization) {
74          double temp = min;
75          min = max;
76          max = temp;
77        }
78
79        DoubleValue best = BestQualityParameter.ActualValue;
80        if (best == null) BestQualityParameter.ActualValue = new DoubleValue(max);
81        else best.Value = max;
82        DoubleValue average = AverageQualityParameter.ActualValue;
83        if (average == null) AverageQualityParameter.ActualValue = new DoubleValue(sum / qualities.Length);
84        else average.Value = sum / qualities.Length;
85        DoubleValue worst = WorstQualityParameter.ActualValue;
86        if (worst == null) WorstQualityParameter.ActualValue = new DoubleValue(min);
87        else worst.Value = min;
88      }
89      return base.Apply();
90    }
91  }
92}
Note: See TracBrowser for help on using the repository browser.