[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2008 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 System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 | using HeuristicLab.Operators;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Logging {
|
---|
[1167] | 30 | /// <summary>
|
---|
| 31 | /// Captures the best, the average and the worst quality of the current population.
|
---|
| 32 | /// </summary>
|
---|
[2] | 33 | public class BestAverageWorstQualityCalculator : OperatorBase {
|
---|
[1167] | 34 | /// <inheritdoc select="summary"/>
|
---|
[2] | 35 | public override string Description {
|
---|
| 36 | get { return @"TODO\r\nOperator description still missing ..."; }
|
---|
| 37 | }
|
---|
| 38 |
|
---|
[1167] | 39 | /// <summary>
|
---|
| 40 | /// Initializes a new instance of <see cref="BestAverageWorstQualityCalculator"/> with five variable
|
---|
| 41 | /// infos (<c>Quality</c>, <c>Maximization</c>, <c>BestQuality</c>, <c>AverageQuality</c>
|
---|
| 42 | /// and <c>WorstQuality</c>).
|
---|
| 43 | /// </summary>
|
---|
[2] | 44 | public BestAverageWorstQualityCalculator()
|
---|
| 45 | : base() {
|
---|
| 46 | AddVariableInfo(new VariableInfo("Quality", "Quality value of a solution", typeof(DoubleData), VariableKind.In));
|
---|
| 47 | AddVariableInfo(new VariableInfo("Maximization", "Maximization problem", typeof(BoolData), VariableKind.In));
|
---|
| 48 | AddVariableInfo(new VariableInfo("BestQuality", "Quality value of best solution", typeof(DoubleData), VariableKind.New | VariableKind.Out));
|
---|
| 49 | AddVariableInfo(new VariableInfo("AverageQuality", "Average quality value", typeof(DoubleData), VariableKind.New | VariableKind.Out));
|
---|
| 50 | AddVariableInfo(new VariableInfo("WorstQuality", "Quality value of worst solution", typeof(DoubleData), VariableKind.New | VariableKind.Out));
|
---|
| 51 | }
|
---|
| 52 |
|
---|
[1167] | 53 | /// <summary>
|
---|
| 54 | /// Captures the best, the average and the worst quality of the current population.
|
---|
| 55 | /// </summary>
|
---|
| 56 | /// <param name="scope">The scope whose population to test and where to inject the captured values.</param>
|
---|
| 57 | /// <returns><c>null</c>.</returns>
|
---|
[2] | 58 | public override IOperation Apply(IScope scope) {
|
---|
| 59 | double[] qualities = new double[scope.SubScopes.Count];
|
---|
| 60 |
|
---|
| 61 | for (int i = 0; i < scope.SubScopes.Count; i++)
|
---|
[77] | 62 | qualities[i] = scope.SubScopes[i].GetVariableValue<DoubleData>("Quality", false).Data;
|
---|
[2] | 63 |
|
---|
| 64 | double worst = qualities[0];
|
---|
| 65 | double best = qualities[0];
|
---|
| 66 | double average = qualities[0];
|
---|
| 67 | for (int i = 1; i < qualities.Length; i++) {
|
---|
| 68 | if (qualities[i] < worst) worst = qualities[i];
|
---|
| 69 | if (qualities[i] > best) best = qualities[i];
|
---|
| 70 | average += qualities[i];
|
---|
| 71 | }
|
---|
| 72 | average = average / qualities.Length;
|
---|
| 73 |
|
---|
| 74 | if (!GetVariableValue<BoolData>("Maximization", scope, true).Data) {
|
---|
| 75 | double temp = worst;
|
---|
| 76 | worst = best;
|
---|
| 77 | best = temp;
|
---|
| 78 | }
|
---|
| 79 |
|
---|
| 80 | SetValue(GetVariableInfo("BestQuality"), best, scope);
|
---|
| 81 | SetValue(GetVariableInfo("AverageQuality"), average, scope);
|
---|
| 82 | SetValue(GetVariableInfo("WorstQuality"), worst, scope);
|
---|
| 83 |
|
---|
| 84 | return null;
|
---|
| 85 | }
|
---|
| 86 |
|
---|
| 87 | private void SetValue(IVariableInfo info, double value, IScope scope) {
|
---|
| 88 | DoubleData data = GetVariableValue<DoubleData>(info.FormalName, scope, false, false);
|
---|
| 89 | if (data == null) {
|
---|
| 90 | data = new DoubleData();
|
---|
| 91 | if (info.Local)
|
---|
| 92 | AddVariable(new Variable(info.ActualName, data));
|
---|
| 93 | else
|
---|
[77] | 94 | scope.AddVariable(new Variable(scope.TranslateName(info.FormalName), data));
|
---|
[2] | 95 | }
|
---|
| 96 | data.Data = value;
|
---|
| 97 | }
|
---|
| 98 | }
|
---|
| 99 | }
|
---|