source: branches/2520_PersistenceReintegration/HeuristicLab.Analysis/3.3/QualityAnalysis/BestQualityMemorizer.cs @ 16453

Last change on this file since 16453 was 16453, checked in by jkarder, 10 months ago

#2520: updated year of copyrights

File size: 3.6 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2019 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 that updates the best quality found so far with those qualities contained in the scope tree.
33  /// </summary>
34  [Item("BestQualityMemorizer", "An operator that updates the best quality found so far with those qualities contained in the scope tree.")]
35  [StorableClass]
36  public class BestQualityMemorizer : 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
47    #region Storing & Cloning
48    [StorableConstructor]
49    protected BestQualityMemorizer(bool deserializing) : base(deserializing) { }
50    protected BestQualityMemorizer(BestQualityMemorizer original, Cloner cloner) : base(original, cloner) { }
51    public override IDeepCloneable Clone(Cloner cloner) {
52      return new BestQualityMemorizer(this, cloner);
53    }
54    #endregion
55    public BestQualityMemorizer()
56      : base() {
57      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the current problem is a maximization problem, otherwise false."));
58      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value contained in the scope tree which represents the solution quality."));
59      Parameters.Add(new ValueLookupParameter<DoubleValue>("BestQuality", "The quality value of the best solution."));
60    }
61
62    public override IOperation Apply() {
63      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
64      bool maximization = MaximizationParameter.ActualValue.Value;
65      DoubleValue best = BestQualityParameter.ActualValue;
66      double max = (best != null) ? (best.Value) : ((maximization) ? (double.MinValue) : (double.MaxValue));
67
68      foreach (DoubleValue quality in qualities)
69        if (IsBetter(maximization, quality.Value, max)) max = quality.Value;
70
71      if (best == null) BestQualityParameter.ActualValue = new DoubleValue(max);
72      else best.Value = max;
73      return base.Apply();
74    }
75
76    private bool IsBetter(bool maximization, double quality, double max) {
77      return (maximization && quality > max || !maximization && quality < max);
78    }
79  }
80}
Note: See TracBrowser for help on using the repository browser.