Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.ArtificialAnt/3.3/Analyzers/BestAntTrailAnalyzer.cs @ 5760

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

Updated year of copyrights (#1406)

File size: 4.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 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.Linq;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Data;
26using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
27using HeuristicLab.Operators;
28using HeuristicLab.Optimization;
29using HeuristicLab.Parameters;
30using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
31
32namespace HeuristicLab.Problems.ArtificialAnt.Analyzers {
33  /// <summary>
34  /// An operator for analyzing the best ant trail of an artificial ant problem.
35  /// </summary>
36  [Item("BestAntTrailAnalyzer", "An operator for analyzing the best ant trail of an artificial ant problem.")]
37  [StorableClass]
38  public sealed class BestAntTrailAnalyzer : SingleSuccessorOperator, IAntTrailAnalyzer {
39    public ILookupParameter<BoolMatrix> WorldParameter {
40      get { return (ILookupParameter<BoolMatrix>)Parameters["World"]; }
41    }
42    public ScopeTreeLookupParameter<SymbolicExpressionTree> SymbolicExpressionTreeParameter {
43      get { return (ScopeTreeLookupParameter<SymbolicExpressionTree>)Parameters["SymbolicExpressionTree"]; }
44    }
45    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
46      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
47    }
48    public ILookupParameter<IntValue> MaxTimeStepsParameter {
49      get { return (ILookupParameter<IntValue>)Parameters["MaxTimeSteps"]; }
50    }
51    public ILookupParameter<AntTrail> BestSolutionParameter {
52      get { return (ILookupParameter<AntTrail>)Parameters["BestSolution"]; }
53    }
54    public ValueLookupParameter<ResultCollection> ResultsParameter {
55      get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
56    }
57
58    public BestAntTrailAnalyzer()
59      : base() {
60      Parameters.Add(new LookupParameter<BoolMatrix>("World", "The world with food items for the artificial ant."));
61      Parameters.Add(new ScopeTreeLookupParameter<SymbolicExpressionTree>("SymbolicExpressionTree", "The artificial ant solutions from which the best solution should be visualized."));
62      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the artificial ant solutions which should be visualized."));
63      Parameters.Add(new LookupParameter<AntTrail>("BestSolution", "The visual representation of the best ant trail."));
64      Parameters.Add(new LookupParameter<IntValue>("MaxTimeSteps", "The maximal time steps that the artificial ant has available to collect all food items."));
65      Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best artificial ant solution should be stored."));
66    }
67
68    [StorableConstructor]
69    private BestAntTrailAnalyzer(bool deserializing) : base(deserializing) { }
70    private BestAntTrailAnalyzer(BestAntTrailAnalyzer original, Cloner cloner)
71      : base(original, cloner) {
72    }
73    public override IDeepCloneable Clone(Cloner cloner) {
74      return new BestAntTrailAnalyzer(this, cloner);
75    }
76
77    public override IOperation Apply() {
78      ItemArray<SymbolicExpressionTree> expressions = SymbolicExpressionTreeParameter.ActualValue;
79      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
80      BoolMatrix world = WorldParameter.ActualValue;
81      IntValue maxTimeSteps = MaxTimeStepsParameter.ActualValue;
82      ResultCollection results = ResultsParameter.ActualValue;
83
84      int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => -x.Value).First().index;
85
86      AntTrail antTrail = BestSolutionParameter.ActualValue;
87      if (antTrail == null) {
88        var bestAntTrail = new AntTrail(world, expressions[i], maxTimeSteps);
89        BestSolutionParameter.ActualValue = bestAntTrail;
90        results.Add(new Result("Best Artificial Ant Solution", bestAntTrail));
91      } else {
92        antTrail.World = world;
93        antTrail.SymbolicExpressionTree = expressions[i];
94        antTrail.MaxTimeSteps = maxTimeSteps;
95        results["Best Artificial Ant Solution"].Value = antTrail;
96      }
97      return base.Apply();
98    }
99  }
100}
Note: See TracBrowser for help on using the repository browser.