Free cookie consent management tool by TermsFeed Policy Generator

source: branches/CloningRefactoring/HeuristicLab.Problems.TravelingSalesman/3.3/MoveEvaluators/TSPPathMoveEvaluator.cs @ 4683

Last change on this file since 4683 was 4683, checked in by abeham, 13 years ago

#922

  • Refactored HeuristicLab.Problems.TravelingSalesman
File size: 4.6 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 HeuristicLab.Core;
23using HeuristicLab.Data;
24using HeuristicLab.Encodings.PermutationEncoding;
25using HeuristicLab.Parameters;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27using HeuristicLab.Common;
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<DoubleMatrix> DistanceMatrixParameter {
43      get { return (ILookupParameter<DoubleMatrix>)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<DoubleMatrix>("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    public override IOperation Apply() {
61      Permutation permutation = PermutationParameter.ActualValue;
62      DoubleMatrix coordinates = CoordinatesParameter.ActualValue;
63      double relativeQualityDifference = 0;
64      if (UseDistanceMatrixParameter.ActualValue.Value) {
65        DoubleMatrix distanceMatrix = DistanceMatrixParameter.ActualValue;
66        if (distanceMatrix == null) {
67          distanceMatrix = CalculateDistanceMatrix(coordinates);
68          DistanceMatrixParameter.ActualValue = distanceMatrix;
69        }
70        relativeQualityDifference = EvaluateByDistanceMatrix(permutation, distanceMatrix);
71      } else relativeQualityDifference = EvaluateByCoordinates(permutation, coordinates);
72      DoubleValue moveQuality = MoveQualityParameter.ActualValue;
73      if (moveQuality == null) MoveQualityParameter.ActualValue = new DoubleValue(QualityParameter.ActualValue.Value + relativeQualityDifference);
74      else moveQuality.Value = QualityParameter.ActualValue.Value + relativeQualityDifference;
75      return base.Apply();
76    }
77
78    protected abstract double CalculateDistance(double x1, double y1, double x2, double y2);
79    protected abstract double EvaluateByDistanceMatrix(Permutation permutation, DoubleMatrix distanceMatrix);
80    protected abstract double EvaluateByCoordinates(Permutation permutation, DoubleMatrix coordinates);
81
82    private DoubleMatrix CalculateDistanceMatrix(DoubleMatrix c) {
83      DoubleMatrix distanceMatrix = new DoubleMatrix(c.Rows, c.Rows);
84      for (int i = 0; i < distanceMatrix.Rows; i++) {
85        for (int j = 0; j < distanceMatrix.Columns; j++)
86          distanceMatrix[i, j] = CalculateDistance(c[i, 0], c[i, 1], c[j, 0], c[j, 1]);
87      }
88      return distanceMatrix;
89    }
90  }
91}
Note: See TracBrowser for help on using the repository browser.