Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.ArtificialAnt/3.3/BestAntTrailVisualizer.cs @ 3238

Last change on this file since 3238 was 3238, checked in by gkronber, 13 years ago

Implemented a solution visualizer for the artificial ant problem. #952 (Artificial Ant Problem for 3.3)

File size: 3.4 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.Operators;
26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
30
31namespace HeuristicLab.Problems.ArtificialAnt {
32  /// <summary>
33  /// An operator for visualizing the best ant trail of an artificial ant problem.
34  /// </summary>
35  [Item("BestAntTrailVisualizer", "An operator for visualizing the best ant trail of an artificial ant problem.")]
36  [StorableClass]
37  public sealed class BestAntTrailVisualizer : SingleSuccessorOperator, IAntTrailVisualizer {
38    public ILookupParameter<ItemArray<SymbolicExpressionTree>> SymbolicExpressionTreeParameter {
39      get { return (ILookupParameter<ItemArray<SymbolicExpressionTree>>)Parameters["SymbolicExpressionTree"]; }
40    }
41    public ILookupParameter<ItemArray<DoubleValue>> QualityParameter {
42      get { return (ILookupParameter<ItemArray<DoubleValue>>)Parameters["Quality"]; }
43    }
44    public ILookupParameter<AntTrail> AntTrailParameter {
45      get { return (ILookupParameter<AntTrail>)Parameters["AntTrail"]; }
46    }
47    ILookupParameter ISolutionsVisualizer.VisualizationParameter {
48      get { return AntTrailParameter; }
49    }
50
51    public BestAntTrailVisualizer()
52      : base() {
53      Parameters.Add(new LookupParameter<DoubleMatrix>("Coordinates", "The x- and y-Coordinates of the cities."));
54      Parameters.Add(new SubScopesLookupParameter<SymbolicExpressionTree>("SymbolicExpressionTree", "The artificial ant solutions from which the best solution should be visualized."));
55      Parameters.Add(new SubScopesLookupParameter<DoubleValue>("Quality", "The qualities of the artificial ant solutions which should be visualized."));
56      Parameters.Add(new LookupParameter<AntTrail>("AntTrail", "The visual representation of the best ant trail."));
57    }
58
59    public override IOperation Apply() {
60      ItemArray<SymbolicExpressionTree> expressions = SymbolicExpressionTreeParameter.ActualValue;
61      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
62
63      int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => -x.Value).First().index;
64
65      AntTrail antTrail = AntTrailParameter.ActualValue;
66      if (antTrail == null) AntTrailParameter.ActualValue = new AntTrail(expressions[i]);
67      else {
68        antTrail.SymbolicExpressionTree = expressions[i];
69      }
70      return base.Apply();
71    }
72  }
73}
Note: See TracBrowser for help on using the repository browser.