Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.TravelingSalesman/3.3/MoveEvaluators/TSPPathMoveEvaluator.cs @ 3209

Last change on this file since 3209 was 3209, checked in by abeham, 14 years ago

Added 3-opt move and evaluators for the TSP
Added 2-opt move evaluators for TSP Geo and Euclidean
#889

File size: 4.3 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.Operators;
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<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    protected TSPPathMoveEvaluator()
50      : base() {
51      Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));
52      Parameters.Add(new LookupParameter<DoubleMatrix>("Coordinates", "The city's coordinates."));
53      Parameters.Add(new LookupParameter<DoubleMatrix>("DistanceMatrix", "The matrix which contains the distances between the cities."));
54      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."));
55    }
56
57    public override IOperation Apply() {
58      Permutation permutation = PermutationParameter.ActualValue;
59      DoubleMatrix coordinates = CoordinatesParameter.ActualValue;
60      double relativeQualityDifference = 0;
61      if (UseDistanceMatrixParameter.ActualValue.Value) {
62        DoubleMatrix distanceMatrix = DistanceMatrixParameter.ActualValue;
63        if (distanceMatrix == null) {
64          distanceMatrix = CalculateDistanceMatrix(coordinates);
65          DistanceMatrixParameter.ActualValue = distanceMatrix;
66        }
67        relativeQualityDifference = EvaluateByDistanceMatrix(permutation, distanceMatrix);
68      } else relativeQualityDifference = EvaluateByCoordinates(permutation, coordinates);
69      DoubleValue moveQuality = MoveQualityParameter.ActualValue;
70      if (moveQuality == null) MoveQualityParameter.ActualValue = new DoubleValue(QualityParameter.ActualValue.Value + relativeQualityDifference);
71      else moveQuality.Value = QualityParameter.ActualValue.Value + relativeQualityDifference;
72      return base.Apply();
73    }
74
75    protected abstract double CalculateDistance(double x1, double y1, double x2, double y2);
76    protected abstract double EvaluateByDistanceMatrix(Permutation permutation, DoubleMatrix distanceMatrix);
77    protected abstract double EvaluateByCoordinates(Permutation permutation, DoubleMatrix coordinates);
78
79    private DoubleMatrix CalculateDistanceMatrix(DoubleMatrix c) {
80      DoubleMatrix distanceMatrix = new DoubleMatrix(c.Rows, c.Rows);
81      for (int i = 0; i < distanceMatrix.Rows; i++) {
82        for (int j = 0; j < distanceMatrix.Columns; j++)
83          distanceMatrix[i, j] = CalculateDistance(c[i, 0], c[i, 1], c[j, 0], c[j, 1]);
84      }
85      return distanceMatrix;
86    }
87  }
88}
Note: See TracBrowser for help on using the repository browser.