Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2522_RefactorPluginInfrastructure/HeuristicLab.Problems.Orienteering/3.3/Analyzers/BestOrienteeringSolutionAnalyzer.cs @ 16143

Last change on this file since 16143 was 15973, checked in by gkronber, 6 years ago

#2522: merged trunk changes from r13402:15972 to branch resolving conflicts where necessary

File size: 7.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2018 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.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Data;
26using HeuristicLab.Encodings.IntegerVectorEncoding;
27using HeuristicLab.Operators;
28using HeuristicLab.Optimization;
29using HeuristicLab.Parameters;
30using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
31
32namespace HeuristicLab.Problems.Orienteering {
33  public sealed class BestOrienteeringSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer {
34    public bool EnabledByDefault {
35      get { return true; }
36    }
37
38    public IScopeTreeLookupParameter<IntegerVector> IntegerVector {
39      get { return (IScopeTreeLookupParameter<IntegerVector>)Parameters["IntegerVector"]; }
40    }
41    public ILookupParameter<DoubleMatrix> CoordinatesParameter {
42      get { return (ILookupParameter<DoubleMatrix>)Parameters["Coordinates"]; }
43    }
44    public ILookupParameter<DistanceMatrix> DistanceMatrixParameter {
45      get { return (ILookupParameter<DistanceMatrix>)Parameters["DistanceMatrix"]; }
46    }
47    public ILookupParameter<IntValue> StartingPointParameter {
48      get { return (ILookupParameter<IntValue>)Parameters["StartingPoint"]; }
49    }
50    public ILookupParameter<IntValue> TerminalPointParameter {
51      get { return (ILookupParameter<IntValue>)Parameters["TerminalPoint"]; }
52    }
53    public ILookupParameter<DoubleArray> ScoresParameter {
54      get { return (ILookupParameter<DoubleArray>)Parameters["Scores"]; }
55    }
56    public ILookupParameter<DoubleValue> PointVisitingCostsParameter {
57      get { return (ILookupParameter<DoubleValue>)Parameters["PointVisitingCosts"]; }
58    }
59
60    public IScopeTreeLookupParameter<DoubleValue> QualityParameter {
61      get { return (IScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
62    }
63    public IScopeTreeLookupParameter<DoubleValue> PenaltyParameter {
64      get { return (IScopeTreeLookupParameter<DoubleValue>)Parameters["Penalty"]; }
65    }
66    public ILookupParameter<OrienteeringSolution> BestSolutionParameter {
67      get { return (ILookupParameter<OrienteeringSolution>)Parameters["BestSolution"]; }
68    }
69    public IValueLookupParameter<ResultCollection> ResultsParameter {
70      get { return (IValueLookupParameter<ResultCollection>)Parameters["Results"]; }
71    }
72    public ILookupParameter<DoubleValue> BestKnownQualityParameter {
73      get { return (ILookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
74    }
75    public ILookupParameter<IntegerVector> BestKnownSolutionParameter {
76      get { return (ILookupParameter<IntegerVector>)Parameters["BestKnownSolution"]; }
77    }
78
79    [StorableConstructor]
80    private BestOrienteeringSolutionAnalyzer(bool deserializing) : base(deserializing) { }
81    private BestOrienteeringSolutionAnalyzer(BestOrienteeringSolutionAnalyzer original, Cloner cloner) : base(original, cloner) { }
82    public override IDeepCloneable Clone(Cloner cloner) {
83      return new BestOrienteeringSolutionAnalyzer(this, cloner);
84    }
85    public BestOrienteeringSolutionAnalyzer()
86      : base() {
87      Parameters.Add(new ScopeTreeLookupParameter<IntegerVector>("IntegerVector", "The Orienteering solutions which should be analysed."));
88      Parameters.Add(new LookupParameter<DoubleMatrix>("Coordinates", "The x- and y-Coordinates of the points."));
89      Parameters.Add(new LookupParameter<DistanceMatrix>("DistanceMatrix", "The matrix which contains the distances between the points."));
90      Parameters.Add(new LookupParameter<IntValue>("StartingPoint", "Index of the starting point."));
91      Parameters.Add(new LookupParameter<IntValue>("TerminalPoint", "Index of the ending point."));
92      Parameters.Add(new LookupParameter<DoubleArray>("Scores", "The scores of the points."));
93      Parameters.Add(new LookupParameter<DoubleValue>("PointVisitingCosts", "The costs for visiting a point."));
94      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the Orienteering solutions which should be analyzed."));
95      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Penalty", "The applied penalty of the Orienteering solutions."));
96      Parameters.Add(new LookupParameter<OrienteeringSolution>("BestSolution", "The best Orienteering solution."));
97      Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the best Orienteering solution should be stored."));
98      Parameters.Add(new LookupParameter<DoubleValue>("BestKnownQuality", "The quality of the best known solution of this Orienteering instance."));
99      Parameters.Add(new LookupParameter<IntegerVector>("BestKnownSolution", "The best known solution of this Orienteering instance."));
100    }
101
102    public override IOperation Apply() {
103      var solutions = IntegerVector.ActualValue;
104      var qualities = QualityParameter.ActualValue;
105      var penalties = PenaltyParameter.ActualValue;
106      var results = ResultsParameter.ActualValue;
107      var bestKnownQuality = BestKnownQualityParameter.ActualValue;
108
109      int bestIndex = qualities.Select((quality, index) => new { index, quality.Value }).OrderByDescending(x => x.Value).First().index;
110
111      if (bestKnownQuality == null || qualities[bestIndex].Value > bestKnownQuality.Value) {
112        BestKnownQualityParameter.ActualValue = new DoubleValue(qualities[bestIndex].Value);
113        BestKnownSolutionParameter.ActualValue = (IntegerVector)solutions[bestIndex].Clone();
114      }
115
116      var solution = BestSolutionParameter.ActualValue;
117      var coordinates = CoordinatesParameter.ActualValue;
118      var startingPoint = StartingPointParameter.ActualValue;
119      var terminalPoint = TerminalPointParameter.ActualValue;
120      var scores = ScoresParameter.ActualValue;
121      var pointVisitingCosts = PointVisitingCostsParameter.ActualValue;
122      var distances = DistanceMatrixParameter.ActualValue;
123      double distance = distances.CalculateTourLength(solutions[bestIndex].ToList(), pointVisitingCosts.Value);
124
125      if (solution == null) {
126        solution = new OrienteeringSolution(
127          (IntegerVector)solutions[bestIndex].Clone(),
128          coordinates,
129          startingPoint,
130          terminalPoint,
131          scores,
132          new DoubleValue(qualities[bestIndex].Value),
133          new DoubleValue(penalties[bestIndex].Value),
134          new DoubleValue(distance));
135        BestSolutionParameter.ActualValue = solution;
136        results.Add(new Result("Best Orienteering Solution", solution));
137      } else {
138        if (solution.Quality.Value < qualities[bestIndex].Value) {
139          solution.Coordinates = coordinates;
140          solution.Scores = scores;
141          solution.IntegerVector = (IntegerVector)solutions[bestIndex].Clone();
142          solution.Quality.Value = qualities[bestIndex].Value;
143          solution.Penalty.Value = penalties[bestIndex].Value;
144          solution.Distance.Value = distance;
145        }
146      }
147
148      return base.Apply();
149    }
150  }
151}
Note: See TracBrowser for help on using the repository browser.