Free cookie consent management tool by TermsFeed Policy Generator

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

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

Sorted usings and removed unused usings in entire solution (#1094)

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