Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistenceOverhaul/HeuristicLab.Problems.ArtificialAnt/3.4/Analyzers/BestAntTrailAnalyzer.cs @ 17709

Last change on this file since 17709 was 14711, checked in by gkronber, 8 years ago

#2520

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