[9029] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[11576] | 3 | * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[9029] | 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 System;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 26 | using HeuristicLab.Optimization.Operators;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Problems.QuadraticAssignment {
|
---|
| 29 | /// <summary>
|
---|
| 30 | /// An operator that performs similarity calculation between two quadratic assignment solutions.
|
---|
| 31 | /// </summary>
|
---|
| 32 | /// <remarks>
|
---|
| 33 | /// The operator calculates the similarity based on the number of edges the two solutions have in common.
|
---|
| 34 | /// </remarks>
|
---|
| 35 | [Item("QAPSimilarityCalculator", "An operator that performs similarity calculation between two quadratic assignment solutions. The operator calculates the similarity based on the number of edges the two solutions have in common.")]
|
---|
| 36 | public sealed class QAPSimilarityCalculator : SingleObjectiveSolutionSimilarityCalculator {
|
---|
| 37 | private QAPSimilarityCalculator(bool deserializing) : base(deserializing) { }
|
---|
| 38 | private QAPSimilarityCalculator(QAPSimilarityCalculator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 39 | public QAPSimilarityCalculator() : base() { }
|
---|
| 40 |
|
---|
| 41 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 42 | return new QAPSimilarityCalculator(this, cloner);
|
---|
| 43 | }
|
---|
| 44 |
|
---|
| 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.");
|
---|
| 48 | if (left.Length != right.Length)
|
---|
| 49 | throw new ArgumentException("Cannot calculate similarity because the provided solutions have different lengths.");
|
---|
| 50 | if (object.ReferenceEquals(left, right)) return 1.0;
|
---|
| 51 |
|
---|
| 52 | return QAPPermutationProximityCalculator.CalculateGenotypeSimilarity(left, right);
|
---|
| 53 | }
|
---|
| 54 |
|
---|
| 55 | public override double CalculateSolutionSimilarity(IScope leftSolution, IScope rightSolution) {
|
---|
| 56 | var sol1 = leftSolution.Variables[SolutionVariableName].Value as Permutation;
|
---|
| 57 | var sol2 = rightSolution.Variables[SolutionVariableName].Value as Permutation;
|
---|
| 58 |
|
---|
| 59 | return CalculateSimilarity(sol1, sol2);
|
---|
| 60 | }
|
---|
| 61 | }
|
---|
| 62 | }
|
---|