| 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.Core;
|
|---|
| 23 | using HeuristicLab.Data;
|
|---|
| 24 | using HeuristicLab.Operators;
|
|---|
| 25 | using HeuristicLab.Parameters;
|
|---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 27 |
|
|---|
| 28 | namespace HeuristicLab.Analysis {
|
|---|
| 29 | /// <summary>
|
|---|
| 30 | /// An operator which calculates the best, average and worst solution quality of the current population.
|
|---|
| 31 | /// </summary>
|
|---|
| 32 | [Item("BestAverageWorstQualityCalculator", "An operator which calculates the best, average and worst solution quality of the current population.")]
|
|---|
| 33 | [EmptyStorableClass]
|
|---|
| 34 | [Creatable("Test")]
|
|---|
| 35 | public sealed class BestAverageWorstQualityCalculator : SingleSuccessorOperator {
|
|---|
| 36 | public IValueLookupParameter<BoolData> MaximizationParameter {
|
|---|
| 37 | get { return (IValueLookupParameter<BoolData>)Parameters["Maximization"]; }
|
|---|
| 38 | }
|
|---|
| 39 | public ILookupParameter<ItemArray<DoubleData>> QualityParameter {
|
|---|
| 40 | get { return (ILookupParameter<ItemArray<DoubleData>>)Parameters["Quality"]; }
|
|---|
| 41 | }
|
|---|
| 42 | public IValueLookupParameter<DoubleData> BestQualityParameter {
|
|---|
| 43 | get { return (IValueLookupParameter<DoubleData>)Parameters["BestQuality"]; }
|
|---|
| 44 | }
|
|---|
| 45 | public IValueLookupParameter<DoubleData> AverageQualityParameter {
|
|---|
| 46 | get { return (IValueLookupParameter<DoubleData>)Parameters["AverageQuality"]; }
|
|---|
| 47 | }
|
|---|
| 48 | public IValueLookupParameter<DoubleData> WorstQualityParameter {
|
|---|
| 49 | get { return (IValueLookupParameter<DoubleData>)Parameters["WorstQuality"]; }
|
|---|
| 50 | }
|
|---|
| 51 |
|
|---|
| 52 | public BestAverageWorstQualityCalculator()
|
|---|
| 53 | : base() {
|
|---|
| 54 | Parameters.Add(new ValueLookupParameter<BoolData>("Maximization", "True if the current problem is a maximization problem, otherwise false."));
|
|---|
| 55 | Parameters.Add(new SubScopesLookupParameter<DoubleData>("Quality", "The value contained in each sub-scope which represents the solution quality."));
|
|---|
| 56 | Parameters.Add(new ValueLookupParameter<DoubleData>("BestQuality", "The quality value of the best solution."));
|
|---|
| 57 | Parameters.Add(new ValueLookupParameter<DoubleData>("AverageQuality", "The average quality of all solutions."));
|
|---|
| 58 | Parameters.Add(new ValueLookupParameter<DoubleData>("WorstQuality", "The quality value of the worst solution."));
|
|---|
| 59 | }
|
|---|
| 60 |
|
|---|
| 61 |
|
|---|
| 62 | public override IOperation Apply() {
|
|---|
| 63 | ItemArray<DoubleData> 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 | DoubleData best = BestQualityParameter.ActualValue;
|
|---|
| 80 | if (best == null) BestQualityParameter.ActualValue = new DoubleData(max);
|
|---|
| 81 | else best.Value = max;
|
|---|
| 82 | DoubleData average = AverageQualityParameter.ActualValue;
|
|---|
| 83 | if (average == null) AverageQualityParameter.ActualValue = new DoubleData(sum / qualities.Length);
|
|---|
| 84 | else average.Value = sum / qualities.Length;
|
|---|
| 85 | DoubleData worst = WorstQualityParameter.ActualValue;
|
|---|
| 86 | if (worst == null) WorstQualityParameter.ActualValue = new DoubleData(min);
|
|---|
| 87 | else worst.Value = min;
|
|---|
| 88 | }
|
|---|
| 89 | return base.Apply();
|
|---|
| 90 | }
|
|---|
| 91 | }
|
|---|
| 92 | }
|
|---|
