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 |
|
---|
22 | using System.Linq;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Data;
|
---|
26 | using HeuristicLab.Operators;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 | using HeuristicLab.Parameters;
|
---|
29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
30 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.Problems.ArtificialAnt {
|
---|
33 | /// <summary>
|
---|
34 | /// An operator for visualizing the best symbolic expression tree of an artificial ant problem.
|
---|
35 | /// </summary>
|
---|
36 | [Item("BestSymbolicExpressionTreeVisualizer", "An operator for visualizing the best symbolic expression tree of an artificial ant problem.")]
|
---|
37 | [StorableClass]
|
---|
38 | public sealed class BestSymbolicExpressionTreeVisualizer : SingleSuccessorOperator, ISingleObjectiveSolutionsVisualizer, ISolutionsVisualizer {
|
---|
39 | public ILookupParameter<ItemArray<SymbolicExpressionTree>> SymbolicExpressionTreeParameter {
|
---|
40 | get { return (ILookupParameter<ItemArray<SymbolicExpressionTree>>)Parameters["SymbolicExpressionTree"]; }
|
---|
41 | }
|
---|
42 | public ILookupParameter<ItemArray<DoubleValue>> QualityParameter {
|
---|
43 | get { return (ILookupParameter<ItemArray<DoubleValue>>)Parameters["Quality"]; }
|
---|
44 | }
|
---|
45 | public ILookupParameter<SymbolicExpressionTree> BestSymbolicExpressionTreeParameter {
|
---|
46 | get { return (ILookupParameter<SymbolicExpressionTree>)Parameters["BestSymbolicExpressionTree"]; }
|
---|
47 | }
|
---|
48 | ILookupParameter ISolutionsVisualizer.VisualizationParameter {
|
---|
49 | get { return BestSymbolicExpressionTreeParameter; }
|
---|
50 | }
|
---|
51 |
|
---|
52 | public BestSymbolicExpressionTreeVisualizer()
|
---|
53 | : base() {
|
---|
54 | Parameters.Add(new SubScopesLookupParameter<SymbolicExpressionTree>("SymbolicExpressionTree", "The artificial ant solutions from which the best solution should be visualized."));
|
---|
55 | Parameters.Add(new SubScopesLookupParameter<DoubleValue>("Quality", "The qualities of the artificial ant solutions which should be visualized."));
|
---|
56 | Parameters.Add(new LookupParameter<SymbolicExpressionTree>("BestSymbolicExpressionTree", "The best symbolic expression tree of the artificial ant problem."));
|
---|
57 | }
|
---|
58 |
|
---|
59 | public override IOperation Apply() {
|
---|
60 | ItemArray<SymbolicExpressionTree> expressions = SymbolicExpressionTreeParameter.ActualValue;
|
---|
61 | ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
|
---|
62 |
|
---|
63 | int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => -x.Value).First().index;
|
---|
64 |
|
---|
65 | SymbolicExpressionTree bestTree = BestSymbolicExpressionTreeParameter.ActualValue;
|
---|
66 | if (bestTree == null) BestSymbolicExpressionTreeParameter.ActualValue = (SymbolicExpressionTree)expressions[i].Clone();
|
---|
67 | else {
|
---|
68 | bestTree.Root = expressions[i].Root;
|
---|
69 | }
|
---|
70 | return base.Apply();
|
---|
71 | }
|
---|
72 | }
|
---|
73 | }
|
---|