[7789] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16565] | 3 | * Copyright (C) 2002-2019 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Data;
|
---|
| 26 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
| 27 | using HeuristicLab.Optimization.Operators;
|
---|
[16565] | 28 | using HEAL.Attic;
|
---|
[7789] | 29 |
|
---|
| 30 | namespace HeuristicLab.Problems.TestFunctions {
|
---|
| 31 | /// <summary>
|
---|
| 32 | /// An operator that performs similarity calculation between two test functions solutions.
|
---|
| 33 | /// </summary>
|
---|
[8319] | 34 | /// <remarks>
|
---|
| 35 | /// The operator calculates the similarity based on the euclidean distance of the two solutions in n-dimensional space.
|
---|
| 36 | /// </remarks>
|
---|
[8327] | 37 | [Item("SingleObjectiveTestFunctionSimilarityCalculator", "An operator that performs similarity calculation between two test functions solutions. The operator calculates the similarity based on the euclidean distance of the two solutions in n-dimensional space.")]
|
---|
[16565] | 38 | [StorableType("E6CD365A-5554-42D5-8A5B-6CE3B916A375")]
|
---|
[8319] | 39 | public sealed class SingleObjectiveTestFunctionSimilarityCalculator : SingleObjectiveSolutionSimilarityCalculator {
|
---|
[12070] | 40 | protected override bool IsCommutative { get { return true; } }
|
---|
| 41 |
|
---|
[8303] | 42 | [Storable]
|
---|
[7954] | 43 | public DoubleMatrix Bounds { get; set; }
|
---|
[7789] | 44 |
|
---|
[8303] | 45 | [StorableConstructor]
|
---|
[16565] | 46 | private SingleObjectiveTestFunctionSimilarityCalculator(StorableConstructorFlag _) : base(_) { }
|
---|
[8303] | 47 | private SingleObjectiveTestFunctionSimilarityCalculator(SingleObjectiveTestFunctionSimilarityCalculator original, Cloner cloner)
|
---|
| 48 | : base(original, cloner) {
|
---|
| 49 | this.Bounds = cloner.Clone(original.Bounds);
|
---|
| 50 | }
|
---|
[7954] | 51 | public SingleObjectiveTestFunctionSimilarityCalculator() : base() { }
|
---|
[7789] | 52 |
|
---|
[8303] | 53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 54 | return new SingleObjectiveTestFunctionSimilarityCalculator(this, cloner);
|
---|
| 55 | }
|
---|
| 56 |
|
---|
[8086] | 57 | public static double CalculateSimilarity(RealVector left, RealVector right, DoubleMatrix bounds) {
|
---|
| 58 | if (left == null || right == null)
|
---|
| 59 | throw new ArgumentException("Cannot calculate similarity because one of the provided solutions or both are null.");
|
---|
| 60 | if (bounds == null)
|
---|
| 61 | throw new ArgumentException("Cannot calculate similarity because no bounds were provided.");
|
---|
[8319] | 62 | if (left.Length != right.Length)
|
---|
| 63 | throw new ArgumentException("Cannot calculate similarity because the provided solutions have different lengths.");
|
---|
[8304] | 64 | if (left == right) return 1.0;
|
---|
[7789] | 65 |
|
---|
| 66 | double maxSum = 0.0;
|
---|
[8086] | 67 | for (int i = 0; i < left.Length; i++)
|
---|
| 68 | maxSum += Math.Pow(bounds[0, 0] - bounds[0, 1], 2);
|
---|
| 69 | double maxDistance = Math.Sqrt(maxSum) / left.Length;
|
---|
[7789] | 70 |
|
---|
| 71 | double sum = 0.0;
|
---|
[8086] | 72 | for (int i = 0; i < left.Length; i++)
|
---|
| 73 | sum += Math.Pow(left[i] - right[i], 2);
|
---|
| 74 | double distance = Math.Sqrt(sum) / left.Length;
|
---|
[7789] | 75 |
|
---|
| 76 | return 1.0 - distance / maxDistance;
|
---|
| 77 | }
|
---|
[8086] | 78 |
|
---|
[8319] | 79 | public override double CalculateSolutionSimilarity(IScope leftSolution, IScope rightSolution) {
|
---|
| 80 | var sol1 = leftSolution.Variables[SolutionVariableName].Value as RealVector;
|
---|
| 81 | var sol2 = rightSolution.Variables[SolutionVariableName].Value as RealVector;
|
---|
[8086] | 82 |
|
---|
| 83 | return CalculateSimilarity(sol1, sol2, Bounds);
|
---|
| 84 | }
|
---|
[7789] | 85 | }
|
---|
| 86 | }
|
---|