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 |
|
---|
22 | using HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Operators;
|
---|
26 | using HeuristicLab.Parameters;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Analysis {
|
---|
30 | /// <summary>
|
---|
31 | /// An operator that updates the best quality found so far with those qualities in the subscopes.
|
---|
32 | /// </summary>
|
---|
33 | [Item("BestQualityMemorizer", "An operator that updates the best quality found so far with those qualities in the subscopes.")]
|
---|
34 | [StorableClass]
|
---|
35 | public class BestQualityMemorizer : 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 |
|
---|
46 | public BestQualityMemorizer()
|
---|
47 | : base() {
|
---|
48 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the current problem is a maximization problem, otherwise false."));
|
---|
49 | Parameters.Add(new SubScopesLookupParameter<DoubleValue>("Quality", "The value contained in each sub-scope which represents the solution quality."));
|
---|
50 | Parameters.Add(new ValueLookupParameter<DoubleValue>("BestQuality", "The quality value of the best solution."));
|
---|
51 | }
|
---|
52 |
|
---|
53 | public override IOperation Apply() {
|
---|
54 | ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
|
---|
55 | bool maximization = MaximizationParameter.ActualValue.Value;
|
---|
56 | DoubleValue best = BestQualityParameter.ActualValue;
|
---|
57 | double max = (best != null) ? (best.Value) : ((maximization) ? (double.MinValue) : (double.MaxValue));
|
---|
58 |
|
---|
59 | foreach (DoubleValue quality in qualities)
|
---|
60 | if (IsBetter(maximization, quality.Value, max)) max = quality.Value;
|
---|
61 |
|
---|
62 | if (best == null) BestQualityParameter.ActualValue = new DoubleValue(max);
|
---|
63 | else best.Value = max;
|
---|
64 | return base.Apply();
|
---|
65 | }
|
---|
66 |
|
---|
67 | private bool IsBetter(bool maximization, double quality, double max) {
|
---|
68 | return (maximization && quality > max || !maximization && quality < max);
|
---|
69 | }
|
---|
70 | }
|
---|
71 | }
|
---|