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 {
|
---|
30 | public class BestAverageWorstQualityCalculator : OperatorBase {
|
---|
31 | public override string Description {
|
---|
32 | get { return @"TODO\r\nOperator description still missing ..."; }
|
---|
33 | }
|
---|
34 |
|
---|
35 | public BestAverageWorstQualityCalculator()
|
---|
36 | : base() {
|
---|
37 | AddVariableInfo(new VariableInfo("Quality", "Quality value of a solution", typeof(DoubleData), VariableKind.In));
|
---|
38 | AddVariableInfo(new VariableInfo("Maximization", "Maximization problem", typeof(BoolData), VariableKind.In));
|
---|
39 | AddVariableInfo(new VariableInfo("BestQuality", "Quality value of best solution", typeof(DoubleData), VariableKind.New | VariableKind.Out));
|
---|
40 | AddVariableInfo(new VariableInfo("AverageQuality", "Average quality value", typeof(DoubleData), VariableKind.New | VariableKind.Out));
|
---|
41 | AddVariableInfo(new VariableInfo("WorstQuality", "Quality value of worst solution", typeof(DoubleData), VariableKind.New | VariableKind.Out));
|
---|
42 | }
|
---|
43 |
|
---|
44 | public override IOperation Apply(IScope scope) {
|
---|
45 | double[] qualities = new double[scope.SubScopes.Count];
|
---|
46 |
|
---|
47 | for (int i = 0; i < scope.SubScopes.Count; i++)
|
---|
48 | qualities[i] = scope.SubScopes[i].GetVariableValue<DoubleData>(GetVariableInfo("Quality").ActualName, false).Data;
|
---|
49 |
|
---|
50 | double worst = qualities[0];
|
---|
51 | double best = qualities[0];
|
---|
52 | double average = qualities[0];
|
---|
53 | for (int i = 1; i < qualities.Length; i++) {
|
---|
54 | if (qualities[i] < worst) worst = qualities[i];
|
---|
55 | if (qualities[i] > best) best = qualities[i];
|
---|
56 | average += qualities[i];
|
---|
57 | }
|
---|
58 | average = average / qualities.Length;
|
---|
59 |
|
---|
60 | if (!GetVariableValue<BoolData>("Maximization", scope, true).Data) {
|
---|
61 | double temp = worst;
|
---|
62 | worst = best;
|
---|
63 | best = temp;
|
---|
64 | }
|
---|
65 |
|
---|
66 | SetValue(GetVariableInfo("BestQuality"), best, scope);
|
---|
67 | SetValue(GetVariableInfo("AverageQuality"), average, scope);
|
---|
68 | SetValue(GetVariableInfo("WorstQuality"), worst, scope);
|
---|
69 |
|
---|
70 | return null;
|
---|
71 | }
|
---|
72 |
|
---|
73 | private void SetValue(IVariableInfo info, double value, IScope scope) {
|
---|
74 | DoubleData data = GetVariableValue<DoubleData>(info.FormalName, scope, false, false);
|
---|
75 | if (data == null) {
|
---|
76 | data = new DoubleData();
|
---|
77 | if (info.Local)
|
---|
78 | AddVariable(new Variable(info.ActualName, data));
|
---|
79 | else
|
---|
80 | scope.AddVariable(new Variable(info.ActualName, data));
|
---|
81 | }
|
---|
82 | data.Data = value;
|
---|
83 | }
|
---|
84 | }
|
---|
85 | }
|
---|