Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.Hive.Azure/HeuristicLab.Analysis/3.3/QualityAnalysis/BestQualityMemorizer.cs @ 7317

Last change on this file since 7317 was 7270, checked in by spimming, 13 years ago

#1680:

  • merged changes from trunk into branch
File size: 3.6 KB
RevLine 
[2997]1#region License Information
2/* HeuristicLab
[7270]3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[2997]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
[4722]22using HeuristicLab.Common;
[2997]23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Operators;
26using HeuristicLab.Parameters;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28
29namespace HeuristicLab.Analysis {
30  /// <summary>
[3662]31  /// An operator that updates the best quality found so far with those qualities contained in the scope tree.
[2997]32  /// </summary>
[3662]33  [Item("BestQualityMemorizer", "An operator that updates the best quality found so far with those qualities contained in the scope tree.")]
[3017]34  [StorableClass]
[2997]35  public class BestQualityMemorizer : SingleSuccessorOperator {
[3662]36    public ValueLookupParameter<BoolValue> MaximizationParameter {
37      get { return (ValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
[2997]38    }
[3662]39    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
40      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
[2997]41    }
[3662]42    public ValueLookupParameter<DoubleValue> BestQualityParameter {
43      get { return (ValueLookupParameter<DoubleValue>)Parameters["BestQuality"]; }
[2997]44    }
45
[4722]46    #region Storing & Cloning
47    [StorableConstructor]
48    protected BestQualityMemorizer(bool deserializing) : base(deserializing) { }
49    protected BestQualityMemorizer(BestQualityMemorizer original, Cloner cloner) : base(original, cloner) { }
50    public override IDeepCloneable Clone(Cloner cloner) {
51      return new BestQualityMemorizer(this, cloner);
52    }
53    #endregion
[2997]54    public BestQualityMemorizer()
55      : base() {
[3048]56      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the current problem is a maximization problem, otherwise false."));
[3662]57      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value contained in the scope tree which represents the solution quality."));
[3048]58      Parameters.Add(new ValueLookupParameter<DoubleValue>("BestQuality", "The quality value of the best solution."));
[2997]59    }
60
61    public override IOperation Apply() {
[3048]62      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
[2997]63      bool maximization = MaximizationParameter.ActualValue.Value;
[3048]64      DoubleValue best = BestQualityParameter.ActualValue;
[2997]65      double max = (best != null) ? (best.Value) : ((maximization) ? (double.MinValue) : (double.MaxValue));
[3080]66
[3048]67      foreach (DoubleValue quality in qualities)
[2997]68        if (IsBetter(maximization, quality.Value, max)) max = quality.Value;
69
[3048]70      if (best == null) BestQualityParameter.ActualValue = new DoubleValue(max);
[2997]71      else best.Value = max;
72      return base.Apply();
73    }
74
75    private bool IsBetter(bool maximization, double quality, double max) {
76      return (maximization && quality > max || !maximization && quality < max);
77    }
78  }
79}
Note: See TracBrowser for help on using the repository browser.