[7789] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[11171] | 3 | * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[7789] | 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 |
|
---|
[8086] | 22 | using System;
|
---|
[7789] | 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 26 | using HeuristicLab.Optimization.Operators;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Problems.TravelingSalesman {
|
---|
| 29 | /// <summary>
|
---|
| 30 | /// An operator that performs similarity calculation between two traveling salesman solutions.
|
---|
| 31 | /// </summary>
|
---|
[8319] | 32 | /// <remarks>
|
---|
| 33 | /// The operator calculates the similarity based on the number of edges the two solutions have in common.
|
---|
| 34 | /// </remarks>
|
---|
[8327] | 35 | [Item("TSPSimilarityCalculator", "An operator that performs similarity calculation between two traveling salesman solutions. The operator calculates the similarity based on the number of edges the two solutions have in common.")]
|
---|
[8319] | 36 | public sealed class TSPSimilarityCalculator : SingleObjectiveSolutionSimilarityCalculator {
|
---|
[7789] | 37 | private TSPSimilarityCalculator(bool deserializing) : base(deserializing) { }
|
---|
| 38 | private TSPSimilarityCalculator(TSPSimilarityCalculator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 39 | public TSPSimilarityCalculator() : base() { }
|
---|
| 40 |
|
---|
[8303] | 41 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 42 | return new TSPSimilarityCalculator(this, cloner);
|
---|
| 43 | }
|
---|
| 44 |
|
---|
[8086] | 45 | public static double CalculateSimilarity(Permutation left, Permutation right) {
|
---|
| 46 | if (left == null || right == null)
|
---|
| 47 | throw new ArgumentException("Cannot calculate similarity because one of the provided solutions or both are null.");
|
---|
[8319] | 48 | if (left.PermutationType != right.PermutationType)
|
---|
| 49 | throw new ArgumentException("Cannot calculate similarity because the provided solutions have different types.");
|
---|
| 50 | if (left.Length != right.Length)
|
---|
| 51 | throw new ArgumentException("Cannot calculate similarity because the provided solutions have different lengths.");
|
---|
[9030] | 52 | if (object.ReferenceEquals(left, right)) return 1.0;
|
---|
[7789] | 53 |
|
---|
[8319] | 54 | switch (left.PermutationType) {
|
---|
| 55 | case PermutationTypes.Absolute:
|
---|
| 56 | return CalculateAbsolute(left, right);
|
---|
| 57 | case PermutationTypes.RelativeDirected:
|
---|
| 58 | return CalculateRelativeDirected(left, right);
|
---|
| 59 | case PermutationTypes.RelativeUndirected:
|
---|
| 60 | return CalculateRelativeUndirected(left, right);
|
---|
| 61 | default:
|
---|
| 62 | throw new InvalidOperationException("unknown permutation type");
|
---|
| 63 | }
|
---|
| 64 | }
|
---|
| 65 |
|
---|
| 66 | private static double CalculateAbsolute(Permutation left, Permutation right) {
|
---|
| 67 | double similarity = 0.0;
|
---|
[8322] | 68 | for (int i = 0; i < left.Length; i++)
|
---|
| 69 | if (left[i] == right[i]) similarity++;
|
---|
| 70 |
|
---|
[8319] | 71 | return similarity / left.Length;
|
---|
| 72 | }
|
---|
| 73 |
|
---|
| 74 | private static double CalculateRelativeDirected(Permutation left, Permutation right) {
|
---|
[9443] | 75 | int[] edgesR = CalculateEdgesVector(right);
|
---|
| 76 | int[] edgesL = CalculateEdgesVector(left);
|
---|
[8322] | 77 |
|
---|
| 78 | double similarity = 0.0;
|
---|
[9443] | 79 | for (int i = 0; i < left.Length; i++) {
|
---|
| 80 | if (edgesL[i] == edgesR[i]) similarity++;
|
---|
| 81 | }
|
---|
[8322] | 82 |
|
---|
| 83 | return similarity / left.Length;
|
---|
[8319] | 84 | }
|
---|
| 85 |
|
---|
| 86 | private static double CalculateRelativeUndirected(Permutation left, Permutation right) {
|
---|
[9413] | 87 | int[] edgesR = CalculateEdgesVector(right);
|
---|
| 88 | int[] edgesL = CalculateEdgesVector(left);
|
---|
[7789] | 89 |
|
---|
| 90 | double similarity = 0.0;
|
---|
[8086] | 91 | for (int i = 0; i < left.Length; i++) {
|
---|
[9413] | 92 | if ((edgesL[i] == edgesR[i]) || (edgesL[edgesR[i]] == i))
|
---|
[7789] | 93 | similarity++;
|
---|
| 94 | }
|
---|
| 95 |
|
---|
[8086] | 96 | return similarity / left.Length;
|
---|
[7789] | 97 | }
|
---|
[8086] | 98 |
|
---|
[9413] | 99 | private static int[] CalculateEdgesVector(Permutation permutation) {
|
---|
| 100 | // transform path representation into adjacency representation
|
---|
| 101 | int[] edgesVector = new int[permutation.Length];
|
---|
| 102 | for (int i = 0; i < permutation.Length - 1; i++)
|
---|
| 103 | edgesVector[permutation[i]] = permutation[i + 1];
|
---|
| 104 | edgesVector[permutation[permutation.Length - 1]] = permutation[0];
|
---|
| 105 | return edgesVector;
|
---|
| 106 | }
|
---|
| 107 |
|
---|
[8319] | 108 | public override double CalculateSolutionSimilarity(IScope leftSolution, IScope rightSolution) {
|
---|
| 109 | var sol1 = leftSolution.Variables[SolutionVariableName].Value as Permutation;
|
---|
| 110 | var sol2 = rightSolution.Variables[SolutionVariableName].Value as Permutation;
|
---|
[8086] | 111 |
|
---|
| 112 | return CalculateSimilarity(sol1, sol2);
|
---|
| 113 | }
|
---|
[7789] | 114 | }
|
---|
| 115 | }
|
---|