[3074] | 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 |
|
---|
| 22 | using HeuristicLab.Core;
|
---|
| 23 | using HeuristicLab.Data;
|
---|
| 24 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 25 | using HeuristicLab.Parameters;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 |
|
---|
[3158] | 28 | namespace HeuristicLab.Problems.TravelingSalesman {
|
---|
[3074] | 29 | /// <summary>
|
---|
| 30 | /// A base class for operators which evaluate TSP solutions.
|
---|
| 31 | /// </summary>
|
---|
| 32 | [Item("TSPMoveEvaluator", "A base class for operators which evaluate TSP moves.")]
|
---|
| 33 | [StorableClass]
|
---|
| 34 | public abstract class TSPPathMoveEvaluator : TSPMoveEvaluator, ITSPPathMoveEvaluator {
|
---|
| 35 | public ILookupParameter<Permutation> PermutationParameter {
|
---|
| 36 | get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; }
|
---|
| 37 | }
|
---|
| 38 | public ILookupParameter<DoubleMatrix> CoordinatesParameter {
|
---|
| 39 | get { return (ILookupParameter<DoubleMatrix>)Parameters["Coordinates"]; }
|
---|
| 40 | }
|
---|
| 41 | public ILookupParameter<DoubleMatrix> DistanceMatrixParameter {
|
---|
| 42 | get { return (ILookupParameter<DoubleMatrix>)Parameters["DistanceMatrix"]; }
|
---|
| 43 | }
|
---|
| 44 | public ILookupParameter<BoolValue> UseDistanceMatrixParameter {
|
---|
| 45 | get { return (ILookupParameter<BoolValue>)Parameters["UseDistanceMatrix"]; }
|
---|
| 46 | }
|
---|
| 47 |
|
---|
| 48 | protected TSPPathMoveEvaluator()
|
---|
| 49 | : base() {
|
---|
| 50 | Parameters.Add(new LookupParameter<Permutation>("Permutation", "The solution as permutation."));
|
---|
| 51 | Parameters.Add(new LookupParameter<DoubleMatrix>("Coordinates", "The city's coordinates."));
|
---|
| 52 | Parameters.Add(new LookupParameter<DoubleMatrix>("DistanceMatrix", "The matrix which contains the distances between the cities."));
|
---|
| 53 | 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."));
|
---|
| 54 | }
|
---|
[3209] | 55 |
|
---|
| 56 | public override IOperation Apply() {
|
---|
| 57 | Permutation permutation = PermutationParameter.ActualValue;
|
---|
| 58 | DoubleMatrix coordinates = CoordinatesParameter.ActualValue;
|
---|
| 59 | double relativeQualityDifference = 0;
|
---|
| 60 | if (UseDistanceMatrixParameter.ActualValue.Value) {
|
---|
| 61 | DoubleMatrix distanceMatrix = DistanceMatrixParameter.ActualValue;
|
---|
| 62 | if (distanceMatrix == null) {
|
---|
| 63 | distanceMatrix = CalculateDistanceMatrix(coordinates);
|
---|
| 64 | DistanceMatrixParameter.ActualValue = distanceMatrix;
|
---|
| 65 | }
|
---|
| 66 | relativeQualityDifference = EvaluateByDistanceMatrix(permutation, distanceMatrix);
|
---|
| 67 | } else relativeQualityDifference = EvaluateByCoordinates(permutation, coordinates);
|
---|
| 68 | DoubleValue moveQuality = MoveQualityParameter.ActualValue;
|
---|
| 69 | if (moveQuality == null) MoveQualityParameter.ActualValue = new DoubleValue(QualityParameter.ActualValue.Value + relativeQualityDifference);
|
---|
| 70 | else moveQuality.Value = QualityParameter.ActualValue.Value + relativeQualityDifference;
|
---|
| 71 | return base.Apply();
|
---|
| 72 | }
|
---|
| 73 |
|
---|
| 74 | protected abstract double CalculateDistance(double x1, double y1, double x2, double y2);
|
---|
| 75 | protected abstract double EvaluateByDistanceMatrix(Permutation permutation, DoubleMatrix distanceMatrix);
|
---|
| 76 | protected abstract double EvaluateByCoordinates(Permutation permutation, DoubleMatrix coordinates);
|
---|
| 77 |
|
---|
| 78 | private DoubleMatrix CalculateDistanceMatrix(DoubleMatrix c) {
|
---|
| 79 | DoubleMatrix distanceMatrix = new DoubleMatrix(c.Rows, c.Rows);
|
---|
| 80 | for (int i = 0; i < distanceMatrix.Rows; i++) {
|
---|
| 81 | for (int j = 0; j < distanceMatrix.Columns; j++)
|
---|
| 82 | distanceMatrix[i, j] = CalculateDistance(c[i, 0], c[i, 1], c[j, 0], c[j, 1]);
|
---|
| 83 | }
|
---|
| 84 | return distanceMatrix;
|
---|
| 85 | }
|
---|
[3074] | 86 | }
|
---|
| 87 | }
|
---|