[2997] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17181] | 3 | * Copyright (C) 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] | 22 | using HeuristicLab.Common;
|
---|
[2997] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
[12005] | 26 | using HeuristicLab.Optimization;
|
---|
[2997] | 27 | using HeuristicLab.Parameters;
|
---|
[17097] | 28 | using HEAL.Attic;
|
---|
[2997] | 29 |
|
---|
| 30 | namespace HeuristicLab.Analysis {
|
---|
| 31 | /// <summary>
|
---|
[3662] | 32 | /// An operator that updates the best quality found so far with those qualities contained in the scope tree.
|
---|
[2997] | 33 | /// </summary>
|
---|
[3662] | 34 | [Item("BestQualityMemorizer", "An operator that updates the best quality found so far with those qualities contained in the scope tree.")]
|
---|
[17097] | 35 | [StorableType("911B6177-6696-43DB-A113-D246CD87D25A")]
|
---|
[12005] | 36 | public class BestQualityMemorizer : SingleSuccessorOperator, ISingleObjectiveOperator {
|
---|
[3662] | 37 | public ValueLookupParameter<BoolValue> MaximizationParameter {
|
---|
| 38 | get { return (ValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
---|
[2997] | 39 | }
|
---|
[3662] | 40 | public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
|
---|
| 41 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
|
---|
[2997] | 42 | }
|
---|
[3662] | 43 | public ValueLookupParameter<DoubleValue> BestQualityParameter {
|
---|
| 44 | get { return (ValueLookupParameter<DoubleValue>)Parameters["BestQuality"]; }
|
---|
[2997] | 45 | }
|
---|
| 46 |
|
---|
[4722] | 47 | #region Storing & Cloning
|
---|
| 48 | [StorableConstructor]
|
---|
[17097] | 49 | protected BestQualityMemorizer(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 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
|
---|
[2997] | 55 | public BestQualityMemorizer()
|
---|
| 56 | : base() {
|
---|
[3048] | 57 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the current problem is a maximization problem, otherwise false."));
|
---|
[3662] | 58 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value contained in the scope tree which represents the solution quality."));
|
---|
[3048] | 59 | Parameters.Add(new ValueLookupParameter<DoubleValue>("BestQuality", "The quality value of the best solution."));
|
---|
[2997] | 60 | }
|
---|
| 61 |
|
---|
| 62 | public override IOperation Apply() {
|
---|
[3048] | 63 | ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
|
---|
[2997] | 64 | bool maximization = MaximizationParameter.ActualValue.Value;
|
---|
[3048] | 65 | DoubleValue best = BestQualityParameter.ActualValue;
|
---|
[2997] | 66 | double max = (best != null) ? (best.Value) : ((maximization) ? (double.MinValue) : (double.MaxValue));
|
---|
[3080] | 67 |
|
---|
[3048] | 68 | foreach (DoubleValue quality in qualities)
|
---|
[2997] | 69 | if (IsBetter(maximization, quality.Value, max)) max = quality.Value;
|
---|
| 70 |
|
---|
[3048] | 71 | if (best == null) BestQualityParameter.ActualValue = new DoubleValue(max);
|
---|
[2997] | 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 | }
|
---|