Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistenceSpeedUp/HeuristicLab.Problems.TravelingSalesman/3.3/MoveEvaluators/TSPPathMoveEvaluator.cs @ 13184

Last change on this file since 13184 was 5445, checked in by swagner, 14 years ago

Updated year of copyrights (#1406)

File size: 5.3 KB
Line 
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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Encodings.PermutationEncoding;
26using HeuristicLab.Parameters;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28
29namespace HeuristicLab.Problems.TravelingSalesman {
30  /// <summary>
31  /// A base class for operators which evaluate TSP solutions.
32  /// </summary>
33  [Item("TSPMoveEvaluator", "A base class for operators which evaluate TSP moves.")]
34  [StorableClass]
35  public abstract class TSPPathMoveEvaluator : TSPMoveEvaluator, ITSPPathMoveEvaluator {
36    public ILookupParameter<Permutation> PermutationParameter {
37      get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; }
38    }
39    public ILookupParameter<DoubleMatrix> CoordinatesParameter {
40      get { return (ILookupParameter<DoubleMatrix>)Parameters["Coordinates"]; }
41    }
42    public ILookupParameter<DistanceMatrix> DistanceMatrixParameter {
43      get { return (ILookupParameter<DistanceMatrix>)Parameters["DistanceMatrix"]; }
44    }
45    public ILookupParameter<BoolValue> UseDistanceMatrixParameter {
46      get { return (ILookupParameter<BoolValue>)Parameters["UseDistanceMatrix"]; }
47    }
48
49    [StorableConstructor]
50    protected TSPPathMoveEvaluator(bool deserializing) : base(deserializing) { }
51    protected TSPPathMoveEvaluator(TSPPathMoveEvaluator original, Cloner cloner) : base(original, cloner) { }
52    protected TSPPathMoveEvaluator()
53      : base() {
54      Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));
55      Parameters.Add(new LookupParameter<DoubleMatrix>("Coordinates", "The city's coordinates."));
56      Parameters.Add(new LookupParameter<DistanceMatrix>("DistanceMatrix", "The matrix which contains the distances between the cities."));
57      Parameters.Add(new LookupParameter<BoolValue>("UseDistanceMatrix", "True if a distance matrix should be calculated (if it does not exist already) and used for evaluation, otherwise false."));
58    }
59
60    [StorableHook(HookType.AfterDeserialization)]
61    private void AfterDeserialization() {
62      // BackwardsCompatibility3.3
63      #region Backwards compatible code (remove with 3.4)
64      LookupParameter<DoubleMatrix> oldDistanceMatrixParameter = Parameters["DistanceMatrix"] as LookupParameter<DoubleMatrix>;
65      if (oldDistanceMatrixParameter != null) {
66        Parameters.Remove(oldDistanceMatrixParameter);
67        Parameters.Add(new LookupParameter<DistanceMatrix>("DistanceMatrix", "The matrix which contains the distances between the cities."));
68        DistanceMatrixParameter.ActualName = oldDistanceMatrixParameter.ActualName;
69      }
70      #endregion
71    }
72
73    public override IOperation Apply() {
74      Permutation permutation = PermutationParameter.ActualValue;
75      DoubleMatrix coordinates = CoordinatesParameter.ActualValue;
76      double relativeQualityDifference = 0;
77      if (UseDistanceMatrixParameter.ActualValue.Value) {
78        DistanceMatrix distanceMatrix = DistanceMatrixParameter.ActualValue;
79        if (distanceMatrix == null) {
80          distanceMatrix = CalculateDistanceMatrix(coordinates);
81          DistanceMatrixParameter.ActualValue = distanceMatrix;
82        }
83        relativeQualityDifference = EvaluateByDistanceMatrix(permutation, distanceMatrix);
84      } else relativeQualityDifference = EvaluateByCoordinates(permutation, coordinates);
85      DoubleValue moveQuality = MoveQualityParameter.ActualValue;
86      if (moveQuality == null) MoveQualityParameter.ActualValue = new DoubleValue(QualityParameter.ActualValue.Value + relativeQualityDifference);
87      else moveQuality.Value = QualityParameter.ActualValue.Value + relativeQualityDifference;
88      return base.Apply();
89    }
90
91    protected abstract double CalculateDistance(double x1, double y1, double x2, double y2);
92    protected abstract double EvaluateByDistanceMatrix(Permutation permutation, DistanceMatrix distanceMatrix);
93    protected abstract double EvaluateByCoordinates(Permutation permutation, DoubleMatrix coordinates);
94
95    private DistanceMatrix CalculateDistanceMatrix(DoubleMatrix c) {
96      DistanceMatrix distanceMatrix = new DistanceMatrix(c.Rows, c.Rows);
97      for (int i = 0; i < distanceMatrix.Rows; i++) {
98        for (int j = 0; j < distanceMatrix.Columns; j++)
99          distanceMatrix[i, j] = CalculateDistance(c[i, 0], c[i, 1], c[j, 0], c[j, 1]);
100      }
101      return (DistanceMatrix)distanceMatrix.AsReadOnly();
102    }
103  }
104}
Note: See TracBrowser for help on using the repository browser.