[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 | /// Logs the quality (best, average, worst) of a solution.
|
---|
| 32 | /// </summary>
|
---|
[2] | 33 | public class QualityLogger : 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="QualityLogger"/> with two variable infos
|
---|
| 41 | /// (<c>Quality</c> and <c>QualityLog</c>).
|
---|
| 42 | /// </summary>
|
---|
[2] | 43 | public QualityLogger()
|
---|
| 44 | : base() {
|
---|
| 45 | AddVariableInfo(new VariableInfo("Quality", "Quality value of a solution", typeof(DoubleData), VariableKind.In));
|
---|
| 46 | AddVariableInfo(new VariableInfo("QualityLog", "Log of best, average and worst quality values", typeof(Log), VariableKind.In | VariableKind.Out | VariableKind.New));
|
---|
| 47 | }
|
---|
| 48 |
|
---|
[1167] | 49 | /// <summary>
|
---|
| 50 | /// Logs the quality (best, average and worst) of a solution.
|
---|
| 51 | /// </summary>
|
---|
| 52 | /// <param name="scope">The current scope where to log the quality.</param>
|
---|
| 53 | /// <returns><c>null</c>.</returns>
|
---|
[2] | 54 | public override IOperation Apply(IScope scope) {
|
---|
| 55 | double[] qualities = new double[scope.SubScopes.Count];
|
---|
| 56 |
|
---|
| 57 | for (int i = 0; i < scope.SubScopes.Count; i++)
|
---|
[77] | 58 | qualities[i] = scope.SubScopes[i].GetVariableValue<DoubleData>("Quality", false).Data;
|
---|
[2] | 59 |
|
---|
| 60 | double min = qualities[0];
|
---|
| 61 | double max = qualities[0];
|
---|
| 62 | double average = qualities[0];
|
---|
| 63 | for (int i = 1; i < qualities.Length; i++) {
|
---|
| 64 | if (qualities[i] < min) min = qualities[i];
|
---|
| 65 | if (qualities[i] > max) max = qualities[i];
|
---|
| 66 | average += qualities[i];
|
---|
| 67 | }
|
---|
| 68 | average = average / qualities.Length;
|
---|
| 69 |
|
---|
| 70 | Log log = GetVariableValue<Log>("QualityLog", scope, false, false);
|
---|
| 71 | if (log == null) {
|
---|
| 72 | log = new Log(new ItemList());
|
---|
| 73 | IVariableInfo info = GetVariableInfo("QualityLog");
|
---|
| 74 | if (info.Local)
|
---|
| 75 | AddVariable(new Variable(info.ActualName, log));
|
---|
| 76 | else
|
---|
[77] | 77 | scope.AddVariable(new Variable(scope.TranslateName(info.FormalName), log));
|
---|
[2] | 78 | }
|
---|
| 79 | log.Items.Add(new DoubleArrayData(new double[] { min, average, max } ));
|
---|
| 80 |
|
---|
| 81 | return null;
|
---|
| 82 | }
|
---|
| 83 | }
|
---|
| 84 | }
|
---|