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 ant trail of an artificial ant problem.
|
---|
35 | /// </summary>
|
---|
36 | [Item("BestAntTrailVisualizer", "An operator for visualizing the best ant trail of an artificial ant problem.")]
|
---|
37 | [StorableClass]
|
---|
38 | public sealed class BestAntTrailVisualizer : SingleSuccessorOperator, IAntTrailVisualizer {
|
---|
39 | public ILookupParameter<BoolMatrix> WorldParameter {
|
---|
40 | get { return (ILookupParameter<BoolMatrix>)Parameters["World"]; }
|
---|
41 | }
|
---|
42 | public ILookupParameter<ItemArray<SymbolicExpressionTree>> SymbolicExpressionTreeParameter {
|
---|
43 | get { return (ILookupParameter<ItemArray<SymbolicExpressionTree>>)Parameters["SymbolicExpressionTree"]; }
|
---|
44 | }
|
---|
45 | public ILookupParameter<ItemArray<DoubleValue>> QualityParameter {
|
---|
46 | get { return (ILookupParameter<ItemArray<DoubleValue>>)Parameters["Quality"]; }
|
---|
47 | }
|
---|
48 | public ILookupParameter<IntValue> MaxTimeStepsParameter {
|
---|
49 | get { return (ILookupParameter<IntValue>)Parameters["MaxTimeSteps"]; }
|
---|
50 | }
|
---|
51 |
|
---|
52 | public ILookupParameter<AntTrail> AntTrailParameter {
|
---|
53 | get { return (ILookupParameter<AntTrail>)Parameters["AntTrail"]; }
|
---|
54 | }
|
---|
55 | ILookupParameter ISolutionsVisualizer.VisualizationParameter {
|
---|
56 | get { return AntTrailParameter; }
|
---|
57 | }
|
---|
58 |
|
---|
59 | public BestAntTrailVisualizer()
|
---|
60 | : base() {
|
---|
61 | Parameters.Add(new LookupParameter<BoolMatrix>("World", "The world with food items for the artificial ant."));
|
---|
62 | Parameters.Add(new SubScopesLookupParameter<SymbolicExpressionTree>("SymbolicExpressionTree", "The artificial ant solutions from which the best solution should be visualized."));
|
---|
63 | Parameters.Add(new SubScopesLookupParameter<DoubleValue>("Quality", "The qualities of the artificial ant solutions which should be visualized."));
|
---|
64 | Parameters.Add(new LookupParameter<AntTrail>("AntTrail", "The visual representation of the best ant trail."));
|
---|
65 | Parameters.Add(new LookupParameter<IntValue>("MaxTimeSteps", "The maximal time steps that the artificial ant has available to collect all food items."));
|
---|
66 | }
|
---|
67 |
|
---|
68 | public override IOperation Apply() {
|
---|
69 | ItemArray<SymbolicExpressionTree> expressions = SymbolicExpressionTreeParameter.ActualValue;
|
---|
70 | ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
|
---|
71 | BoolMatrix world = WorldParameter.ActualValue;
|
---|
72 | IntValue maxTimeSteps = MaxTimeStepsParameter.ActualValue;
|
---|
73 |
|
---|
74 | int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => -x.Value).First().index;
|
---|
75 |
|
---|
76 | AntTrail antTrail = AntTrailParameter.ActualValue;
|
---|
77 | if (antTrail == null) AntTrailParameter.ActualValue = new AntTrail(world, expressions[i], maxTimeSteps);
|
---|
78 | else {
|
---|
79 | antTrail.World = world;
|
---|
80 | antTrail.SymbolicExpressionTree = expressions[i];
|
---|
81 | antTrail.MaxTimeSteps = maxTimeSteps;
|
---|
82 | }
|
---|
83 | return base.Apply();
|
---|
84 | }
|
---|
85 | }
|
---|
86 | }
|
---|