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