Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.OneMax/3.3/Analyzers/PopulationBestOneMaxSolutionAnalyzer.cs @ 3658

Last change on this file since 3658 was 3658, checked in by swagner, 14 years ago

Worked on refactoring of algorithm analysis and tracing (#999)

  • removed specific analyzer interfaces
  • adapted MultiAnalyzer
File size: 4.0 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using System.Text;
26using HeuristicLab.Optimization;
27using HeuristicLab.Data;
28using HeuristicLab.Core;
29using HeuristicLab.Operators;
30using HeuristicLab.Encodings.BinaryVectorEncoding;
31using HeuristicLab.Parameters;
32using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
33
34namespace HeuristicLab.Problems.OneMax.Analyzers {
35  /// <summary>
36  /// An operator for analyzing the best solution for a OneMax problem.
37  /// </summary>
38  [Item("PopulationBestOneMaxSolutionAnalyzer", "An operator for analyzing the best solution for a OneMax problem.")]
39  [StorableClass]
40  class PopulationBestOneMaxSolutionAnalyzer : SingleSuccessorOperator, IBestOneMaxSolutionAnalyzer, IAnalyzer {
41
42    public ILookupParameter<ItemArray<BinaryVector>> BinaryVectorParameter {
43      get { return (ILookupParameter<ItemArray<BinaryVector>>)Parameters["BinaryVector"]; }
44    }
45    ILookupParameter IBestOneMaxSolutionAnalyzer.BinaryVectorParameter {
46      get { return BinaryVectorParameter; }
47    }
48    public ILookupParameter<ItemArray<DoubleValue>> QualityParameter {
49      get { return (ILookupParameter<ItemArray<DoubleValue>>)Parameters["Quality"]; }
50    }
51    ILookupParameter IBestOneMaxSolutionAnalyzer.QualityParameter {
52      get { return QualityParameter; }
53    }
54    public ILookupParameter<OneMaxSolution> BestSolutionParameter {
55      get { return (ILookupParameter<OneMaxSolution>)Parameters["BestSolution"]; }
56    }
57    public IValueLookupParameter<ResultCollection> ResultsParameter {
58      get { return (IValueLookupParameter<ResultCollection>)Parameters["Results"]; }
59    }
60
61    public PopulationBestOneMaxSolutionAnalyzer()
62      : base() {
63      Parameters.Add(new SubScopesLookupParameter<BinaryVector>("BinaryVector", "The Onemax solutions from which the best solution should be visualized."));
64
65      Parameters.Add(new SubScopesLookupParameter<DoubleValue>("Quality", "The qualities of the Onemax solutions which should be visualized."));
66      Parameters.Add(new LookupParameter<OneMaxSolution>("BestSolution", "The best Onemax solution."));
67      Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the Onemax solution should be stored."));
68    }
69
70    public override IOperation Apply() {
71      ItemArray<BinaryVector> binaryVectors = BinaryVectorParameter.ActualValue;
72      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
73      ResultCollection results = ResultsParameter.ActualValue;
74
75      int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
76      OneMaxSolution solution = BestSolutionParameter.ActualValue;
77      if (solution == null) {
78        solution = new OneMaxSolution(binaryVectors[i], QualityParameter.ActualValue[i]);
79        BestSolutionParameter.ActualValue = solution;
80
81        results.Add(new Result("Best OneMax Solution", solution));
82      } else {
83        solution.BinaryVector = binaryVectors[i];
84        solution.Quality = QualityParameter.ActualValue[i];
85
86        results["Best OneMax Solution"].Value = solution;
87      }
88
89      return base.Apply();
90    }
91  }
92}
Note: See TracBrowser for help on using the repository browser.