Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior.Analyzers/3.3/CrossoverPerformanceAnalyzer.cs @ 9252

Last change on this file since 9252 was 9252, checked in by ascheibe, 11 years ago

#1886 automatically calculate statistical values for each run
File size: 17.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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
23using System;
24using System.Collections.Generic;
25using System.Linq;
26using HeuristicLab.Common;
27using HeuristicLab.Core;
28using HeuristicLab.Data;
29using HeuristicLab.Optimization;
30using HeuristicLab.Parameters;
31using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
32
33namespace HeuristicLab.Analysis.AlgorithmBehavior.Analyzers {
34  [Item("CrossoverPerformanceAnalyzer", "An operator that analyzes the performance of crossovers.")]
35  [StorableClass]
36  public class CrossoverPerformanceAnalyzer : InitializableOperator, IStatefulItem {
37    private const string ResultsParameterName = "Results";
38    private const string GenerationsParameterName = "Generations";
39    private const string SuccessfullCrossoversRowName = "Successfull Crossovers per Generation with CompFact ";
40
41    #region Parameter properties
42    public IValueLookupParameter<BoolValue> MaximizationParameter {
43      get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
44    }
45    public IValueLookupParameter<ItemCollection<DoubleValue>> ComparisonFactorParameter {
46      get { return (IValueLookupParameter<ItemCollection<DoubleValue>>)Parameters["ComparisonFactor"]; }
47    }
48    public ILookupParameter<ResultCollection> ResultsParameter {
49      get { return (ILookupParameter<ResultCollection>)Parameters[ResultsParameterName]; }
50    }
51    public ILookupParameter<IntValue> GenerationsParameter {
52      get { return (ILookupParameter<IntValue>)Parameters[GenerationsParameterName]; }
53    }
54    public ILookupParameter<ItemArray<DoubleValue>> ParentsQualityParameter {
55      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["ParentsQuality"]; }
56    }
57    public ILookupParameter<DoubleValue> QualityParameter {
58      get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
59    }
60    public IValueParameter<ISingleObjectiveSolutionSimilarityCalculator> SimilarityCalculatorParameter {
61      get { return (IValueParameter<ISingleObjectiveSolutionSimilarityCalculator>)Parameters["SimilarityCalculator"]; }
62    }
63    public IValueParameter<IUnwantedMutationAnalyzer> UnwantedMutationAnalyzerParameter {
64      get { return (IValueParameter<IUnwantedMutationAnalyzer>)Parameters["UnwantedMutationAnalyzer"]; }
65    }
66    public ILookupParameter<ItemCollection<IItem>> OperatorsParameter {
67      get { return (ILookupParameter<ItemCollection<IItem>>)Parameters["Operators"]; }
68    }
69    public ILookupParameter<DoubleValue> BestKnownQualityParameter {
70      get { return (ILookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
71    }
72    public ILookupParameter<DoubleValue> WorstKnownQualityParameter {
73      get { return (ILookupParameter<DoubleValue>)Parameters["WorstKnownQuality"]; }
74    }
75    #endregion
76
77    #region Properties
78    public ResultCollection Results {
79      get { return ResultsParameter.ActualValue; }
80    }
81
82    [Storable]
83    private ScatterPlotHelper worseParentCrossoverPerformancePlot, betterParentCrossoverPerformancePlot, childDiversityToWorseParentHelper, childDiversityToBetterParentHelper, parentDiversityHelper, parentQualityHelper, unwantedMutationsHelper;
84    [Storable]
85    private DataTableHelper successHelper, equalParentsHelper;
86    [Storable]
87    private int cnt = 0;
88    [Storable]
89    private int[] success;
90    [Storable]
91    private int lastGeneration = 0;
92    [Storable]
93    private int equalParents = 0;
94    #endregion
95
96
97    [StorableConstructor]
98    private CrossoverPerformanceAnalyzer(bool deserializing) : base(deserializing) { }
99    private CrossoverPerformanceAnalyzer(CrossoverPerformanceAnalyzer original, Cloner cloner)
100      : base(original, cloner) {
101      cnt = original.cnt;
102      success = (int[])original.success.Clone();
103      lastGeneration = original.lastGeneration;
104      equalParents = original.equalParents;
105      worseParentCrossoverPerformancePlot = (ScatterPlotHelper)original.worseParentCrossoverPerformancePlot.Clone(cloner);
106      betterParentCrossoverPerformancePlot = (ScatterPlotHelper)original.betterParentCrossoverPerformancePlot.Clone(cloner);
107      childDiversityToWorseParentHelper = (ScatterPlotHelper)original.childDiversityToWorseParentHelper.Clone(cloner);
108      childDiversityToBetterParentHelper = (ScatterPlotHelper)original.childDiversityToBetterParentHelper.Clone(cloner);
109      parentDiversityHelper = (ScatterPlotHelper)original.parentDiversityHelper.Clone(cloner);
110      parentQualityHelper = (ScatterPlotHelper)original.parentQualityHelper.Clone(cloner);
111      unwantedMutationsHelper = (ScatterPlotHelper)original.unwantedMutationsHelper.Clone(cloner);
112      successHelper = (DataTableHelper)original.successHelper.Clone(cloner);
113      equalParentsHelper = (DataTableHelper)original.equalParentsHelper.Clone(cloner);
114    }
115
116    public CrossoverPerformanceAnalyzer()
117      : base() {
118      Parameters.Add(new LookupParameter<ResultCollection>(ResultsParameterName, "The results collection where the analysis values should be stored."));
119      Parameters.Add(new LookupParameter<IntValue>(GenerationsParameterName, "Nr of generations."));
120
121      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("ParentsQuality", "The quality of the parent solutions."));
122      ParentsQualityParameter.ActualName = "TSPTourLength";
123
124      Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The evaluated quality of the child solution."));
125      QualityParameter.ActualName = "TSPTourLength";
126
127      Parameters.Add(new ValueParameter<ISingleObjectiveSolutionSimilarityCalculator>("SimilarityCalculator"));
128      Parameters.Add(new ValueParameter<IUnwantedMutationAnalyzer>("UnwantedMutationAnalyzer"));
129      Parameters.Add(new LookupParameter<ItemCollection<IItem>>("Operators", "The operators and items that the problem provides to the algorithms."));
130      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, false otherwise"));
131      Parameters.Add(new ValueLookupParameter<ItemCollection<DoubleValue>>("ComparisonFactor", "Determines if the quality should be compared to the better parent (1.0), to the worse (0.0) or to any linearly interpolated value between them."));
132      Parameters.Add(new LookupParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this problem."));
133      Parameters.Add(new LookupParameter<DoubleValue>("WorstKnownQuality", "The quality of the worst known solution of this problem."));
134
135      worseParentCrossoverPerformancePlot = new ScatterPlotHelper(false, true, true, true);
136      betterParentCrossoverPerformancePlot = new ScatterPlotHelper(false, true, true, true);
137      childDiversityToWorseParentHelper = new ScatterPlotHelper(false, true, false, true);
138      childDiversityToBetterParentHelper = new ScatterPlotHelper(false, true, false, true);
139      unwantedMutationsHelper = new ScatterPlotHelper(false, true, false, true);
140      parentDiversityHelper = new ScatterPlotHelper(false, true, false, true);
141      parentQualityHelper = new ScatterPlotHelper(false, true, true, true);
142      successHelper = new DataTableHelper();
143      equalParentsHelper = new DataTableHelper();
144    }
145
146    public override IDeepCloneable Clone(Cloner cloner) {
147      return new CrossoverPerformanceAnalyzer(this, cloner);
148    }
149
150    protected override void InitializeAction() {
151      if (SimilarityCalculatorParameter.Value == null) {
152        SimilarityCalculatorParameter.Value = OperatorsParameter.ActualValue.OfType<ISingleObjectiveSolutionSimilarityCalculator>().FirstOrDefault();
153      }
154
155      if (ComparisonFactorParameter.ActualValue == null) {
156        ComparisonFactorParameter.Value = new ItemCollection<DoubleValue>();
157        ComparisonFactorParameter.Value.Add(new DoubleValue(0));
158        ComparisonFactorParameter.Value.Add(new DoubleValue(0.5));
159        ComparisonFactorParameter.Value.Add(new DoubleValue(1));
160        ComparisonFactorParameter.Value.Add(new DoubleValue(1.5));
161      }
162
163      if (success == null) {
164        success = new int[ComparisonFactorParameter.Value.Count];
165      }
166
167      worseParentCrossoverPerformancePlot.InitializePlot(Results, "Crossover Performance compared to worse parent", "Solution Index", "Absolut Quality Difference");
168      betterParentCrossoverPerformancePlot.InitializePlot(Results, "Crossover Performance compared to better parent", "Solution Index", "Absolut Quality Difference");
169      childDiversityToWorseParentHelper.InitializePlot(Results, "Child Diversity to Worse Parent", "Solution Index", "Diversity");
170      childDiversityToBetterParentHelper.InitializePlot(Results, "Child Diversity to Better Parent", "Solution Index", "Diversity");
171      parentDiversityHelper.InitializePlot(Results, "Parent Diversity", "Solution Index", "Diversity");
172      parentQualityHelper.InitializePlot(Results, "Parent Quality Difference", "Solution Index", "Absolut Quality Difference");
173      equalParentsHelper.InitializeChart(Results, "Number of equal parents", new string[] { "Absolut number of equal parents" });
174      unwantedMutationsHelper.InitializePlot(Results, "Unwanted Mutations", "Solution Index", "Unwanted Mutation");
175
176      List<string> successfullCXRowNames = new List<string>();
177      foreach (var value in ComparisonFactorParameter.Value) {
178        successfullCXRowNames.Add(SuccessfullCrossoversRowName + value.Value.ToString());
179      }
180      successHelper.InitializeChart(Results, "Successfull Crossovers", successfullCXRowNames.ToArray());
181
182      Reset();
183    }
184
185    public override IOperation Apply() {
186      Initialize();
187
188      Point2D<double> worseQualityPoint, betterQualityPoint, childDiversityToWorseParent, childDiversityToBetterParent, diversityPointParent, qualityPointParent, unwantedMutationPoint;
189      var qualityParent1 = ParentsQualityParameter.ActualValue.First().Value;
190      var qualityParent2 = ParentsQualityParameter.ActualValue.Last().Value;
191      var qualityChild = QualityParameter.ActualValue.Value;
192
193      var parentDiversity = SimilarityCalculatorParameter.Value.CalculateSolutionSimilarity(ExecutionContext.Scope.SubScopes.First(), ExecutionContext.Scope.SubScopes.Last());
194      string curGenStr = GenerationsParameter.ActualValue.Value.ToString();
195
196      diversityPointParent = new Point2D<double>(cnt, parentDiversity);
197      qualityPointParent = new Point2D<double>(cnt, Math.Abs(qualityParent1 - qualityParent2));
198      if (UnwantedMutationAnalyzerParameter.Value != null) {
199        unwantedMutationPoint = new Point2D<double>(cnt, UnwantedMutationAnalyzerParameter.Value.AnalyzeUnwantedMutations(ExecutionContext.Scope.SubScopes.First(), ExecutionContext.Scope.SubScopes.Last(), ExecutionContext.Scope));
200      } else {
201        //TODO: this is not a good solution
202        unwantedMutationPoint = new Point2D<double>(cnt, 0.0);
203      }
204
205      double worseQuality, betterQuality;
206
207      if (qualityParent1 > qualityParent2) {
208        if (MaximizationParameter.ActualValue.Value) {
209          childDiversityToWorseParent = new Point2D<double>(cnt, SimilarityCalculatorParameter.Value.CalculateSolutionSimilarity(ExecutionContext.Scope, ExecutionContext.Scope.SubScopes.Last()));
210          childDiversityToBetterParent = new Point2D<double>(cnt, SimilarityCalculatorParameter.Value.CalculateSolutionSimilarity(ExecutionContext.Scope, ExecutionContext.Scope.SubScopes.First()));
211          worseQuality = qualityParent2;
212          betterQuality = qualityParent1;
213        } else {
214          childDiversityToWorseParent = new Point2D<double>(cnt, SimilarityCalculatorParameter.Value.CalculateSolutionSimilarity(ExecutionContext.Scope, ExecutionContext.Scope.SubScopes.First()));
215          childDiversityToBetterParent = new Point2D<double>(cnt, SimilarityCalculatorParameter.Value.CalculateSolutionSimilarity(ExecutionContext.Scope, ExecutionContext.Scope.SubScopes.Last()));
216          worseQuality = qualityParent1;
217          betterQuality = qualityParent2;
218        }
219      } else {
220        if (MaximizationParameter.ActualValue.Value) {
221          childDiversityToWorseParent = new Point2D<double>(cnt, SimilarityCalculatorParameter.Value.CalculateSolutionSimilarity(ExecutionContext.Scope, ExecutionContext.Scope.SubScopes.First()));
222          childDiversityToBetterParent = new Point2D<double>(cnt, SimilarityCalculatorParameter.Value.CalculateSolutionSimilarity(ExecutionContext.Scope, ExecutionContext.Scope.SubScopes.Last()));
223          worseQuality = qualityParent1;
224          betterQuality = qualityParent2;
225        } else {
226          childDiversityToWorseParent = new Point2D<double>(cnt, SimilarityCalculatorParameter.Value.CalculateSolutionSimilarity(ExecutionContext.Scope, ExecutionContext.Scope.SubScopes.Last()));
227          childDiversityToBetterParent = new Point2D<double>(cnt, SimilarityCalculatorParameter.Value.CalculateSolutionSimilarity(ExecutionContext.Scope, ExecutionContext.Scope.SubScopes.First()));
228          worseQuality = qualityParent2;
229          betterQuality = qualityParent1;
230        }
231      }
232
233      worseQualityPoint = new Point2D<double>(cnt, worseQuality - qualityChild);
234      betterQualityPoint = new Point2D<double>(cnt++, betterQuality - qualityChild);
235
236      if (GenerationsParameter.ActualValue.Value == lastGeneration) {
237        CountSuccess(qualityChild, qualityParent1, qualityParent2);
238
239        if (parentDiversity == 1.0) {
240          equalParents++;
241        }
242      }
243
244      if (GenerationsParameter.ActualValue.Value == 1) {
245        double bkQuality = BestKnownQualityParameter.ActualValue.Value;
246        double wkQuality = WorstKnownQualityParameter.ActualValue.Value;
247
248        if (MaximizationParameter.ActualValue.Value) {
249          if (worseParentCrossoverPerformancePlot.Max == double.MinValue) {
250            worseParentCrossoverPerformancePlot.Max = bkQuality - wkQuality;
251            betterParentCrossoverPerformancePlot.Max = bkQuality - wkQuality;
252            parentQualityHelper.Max = bkQuality - wkQuality;
253            worseParentCrossoverPerformancePlot.Min = 0;
254            betterParentCrossoverPerformancePlot.Min = 0;
255            parentQualityHelper.Min = 0;
256          }
257        } else {
258          if (worseParentCrossoverPerformancePlot.Min == double.MaxValue) {
259            worseParentCrossoverPerformancePlot.Max = wkQuality - bkQuality;
260            betterParentCrossoverPerformancePlot.Max = wkQuality - bkQuality;
261            parentQualityHelper.Max = wkQuality - bkQuality;
262            worseParentCrossoverPerformancePlot.Min = 0;
263            betterParentCrossoverPerformancePlot.Min = 0;
264            parentQualityHelper.Min = 0;
265          }
266        }
267      }
268
269      if (GenerationsParameter.ActualValue.Value != 0) {
270        if (GenerationsParameter.ActualValue.Value > lastGeneration) {
271          equalParentsHelper.AddPoint(equalParents);
272
273          for (int i = 0; i < ComparisonFactorParameter.Value.Count; i++) {
274            successHelper.AddPoint(SuccessfullCrossoversRowName + ComparisonFactorParameter.Value.ElementAt(i).Value.ToString(), (double)success[i] / (cnt - 1));
275          }
276
277          Reset();
278
279          CountSuccess(qualityChild, qualityParent1, qualityParent2);
280          if (parentDiversity == 1.0) {
281            equalParents++;
282          }
283        }
284
285        betterParentCrossoverPerformancePlot.AddPoint(curGenStr, betterQualityPoint);
286        worseParentCrossoverPerformancePlot.AddPoint(curGenStr, worseQualityPoint);
287        childDiversityToWorseParentHelper.AddPoint(curGenStr, childDiversityToWorseParent);
288        childDiversityToBetterParentHelper.AddPoint(curGenStr, childDiversityToBetterParent);
289        parentDiversityHelper.AddPoint(curGenStr, diversityPointParent);
290        parentQualityHelper.AddPoint(curGenStr, qualityPointParent);
291        unwantedMutationsHelper.AddPoint(curGenStr, unwantedMutationPoint);
292      }
293
294      return base.Apply();
295    }
296
297    private void CountSuccess(double qualityChild, double qualityParent1, double qualityParent2) {
298      //track successfull cx
299      var compFactsArray = ComparisonFactorParameter.Value.ToArray();
300      for (int i = 0; i < compFactsArray.Length; i++) {
301        if (WeightedParentsQualityComparer.Compare(qualityChild, qualityParent1, qualityParent2, compFactsArray[i].Value, MaximizationParameter.ActualValue.Value)) {
302          success[i]++;
303        }
304      }
305    }
306
307    private void Reset() {
308      cnt = 0;
309      success = new int[ComparisonFactorParameter.Value.Count];
310      lastGeneration = GenerationsParameter.ActualValue.Value;
311      equalParents = 0;
312    }
313
314    public override void ClearState() {
315      betterParentCrossoverPerformancePlot.CleanUp();
316      worseParentCrossoverPerformancePlot.CleanUp();
317      childDiversityToWorseParentHelper.CleanUp();
318      childDiversityToBetterParentHelper.CleanUp();
319      parentDiversityHelper.CleanUp();
320      parentQualityHelper.CleanUp();
321      unwantedMutationsHelper.CleanUp();
322      successHelper.CleanUpAndCompressData();
323      equalParentsHelper.CleanUpAndCompressData();
324    }
325  }
326}
Note: See TracBrowser for help on using the repository browser.