[7789] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12012] | 3 | * Copyright (C) 2002-2015 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;
|
---|
[8304] | 23 | using System.Linq;
|
---|
[7789] | 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
[8299] | 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[7789] | 27 |
|
---|
| 28 | namespace HeuristicLab.Optimization.Operators {
|
---|
| 29 | /// <summary>
|
---|
[8086] | 30 | /// A base class for items that perform similarity calculation between two solutions.
|
---|
[7789] | 31 | /// </summary>
|
---|
[8086] | 32 | [Item("SimilarityCalculator", "A base class for items that perform similarity calculation between two solutions.")]
|
---|
[8299] | 33 | [StorableClass]
|
---|
[8322] | 34 | public abstract class SolutionSimilarityCalculator : Item, ISolutionSimilarityCalculator {
|
---|
[12070] | 35 | protected abstract bool IsCommutative { get; }
|
---|
| 36 |
|
---|
[8299] | 37 | [StorableConstructor]
|
---|
[8319] | 38 | protected SolutionSimilarityCalculator(bool deserializing) : base(deserializing) { }
|
---|
| 39 | protected SolutionSimilarityCalculator(SolutionSimilarityCalculator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 40 | protected SolutionSimilarityCalculator() : base() { }
|
---|
[7789] | 41 |
|
---|
[8319] | 42 | public double[][] CalculateSolutionCrowdSimilarity(IScope leftSolutionCrowd, IScope rightSolutionCrowd) {
|
---|
| 43 | if (leftSolutionCrowd == null || rightSolutionCrowd == null)
|
---|
[8304] | 44 | throw new ArgumentException("Cannot calculate similarity because one of the provided crowds or both are null.");
|
---|
[7789] | 45 |
|
---|
[8319] | 46 | var leftIndividuals = leftSolutionCrowd.SubScopes;
|
---|
| 47 | var rightIndividuals = rightSolutionCrowd.SubScopes;
|
---|
[8304] | 48 |
|
---|
| 49 | if (!leftIndividuals.Any() || !rightIndividuals.Any())
|
---|
| 50 | throw new ArgumentException("Cannot calculate similarity because one of the provided crowds or both are empty.");
|
---|
| 51 |
|
---|
| 52 | var similarityMatrix = new double[leftIndividuals.Count][];
|
---|
| 53 | for (int i = 0; i < leftIndividuals.Count; i++) {
|
---|
| 54 | similarityMatrix[i] = new double[rightIndividuals.Count];
|
---|
| 55 | for (int j = 0; j < rightIndividuals.Count; j++) {
|
---|
[8319] | 56 | similarityMatrix[i][j] = CalculateSolutionSimilarity(leftIndividuals[i], rightIndividuals[j]);
|
---|
[8304] | 57 | }
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | return similarityMatrix;
|
---|
[7789] | 61 | }
|
---|
| 62 |
|
---|
[8319] | 63 | public double[][] CalculateSolutionCrowdSimilarity(IScope solutionCrowd) {
|
---|
| 64 | if (solutionCrowd == null)
|
---|
| 65 | throw new ArgumentException("Cannot calculate similarity because the provided crowd is null.");
|
---|
| 66 |
|
---|
| 67 | var individuals = solutionCrowd.SubScopes;
|
---|
| 68 |
|
---|
| 69 | if (!individuals.Any())
|
---|
| 70 | throw new ArgumentException("Cannot calculate similarity because the provided crowd is empty.");
|
---|
| 71 |
|
---|
| 72 | var similarityMatrix = new double[individuals.Count][];
|
---|
[8413] | 73 | for (int i = 0; i < individuals.Count; i++) similarityMatrix[i] = new double[individuals.Count];
|
---|
| 74 |
|
---|
[12070] | 75 | if (IsCommutative) {
|
---|
| 76 | for (int i = 0; i < individuals.Count; i++) {
|
---|
| 77 | for (int j = i; j < individuals.Count; j++) {
|
---|
| 78 | similarityMatrix[i][j] = similarityMatrix[j][i] = CalculateSolutionSimilarity(individuals[i], individuals[j]);
|
---|
| 79 | }
|
---|
[8319] | 80 | }
|
---|
[12070] | 81 | } else {
|
---|
| 82 | for (int i = 0; i < individuals.Count; i++) {
|
---|
| 83 | for (int j = i; j < individuals.Count; j++) {
|
---|
| 84 | similarityMatrix[i][j] = CalculateSolutionSimilarity(individuals[i], individuals[j]);
|
---|
| 85 | if (i == j) continue;
|
---|
| 86 | similarityMatrix[j][i] = CalculateSolutionSimilarity(individuals[j], individuals[i]);
|
---|
| 87 | }
|
---|
| 88 | }
|
---|
[8319] | 89 | }
|
---|
| 90 |
|
---|
| 91 | return similarityMatrix;
|
---|
| 92 | }
|
---|
| 93 |
|
---|
| 94 | public abstract double CalculateSolutionSimilarity(IScope leftSolution, IScope rightSolution);
|
---|
[8988] | 95 | public abstract bool Equals(IScope x, IScope y);
|
---|
[8319] | 96 | public abstract int GetHashCode(IScope obj);
|
---|
[7789] | 97 | }
|
---|
| 98 | }
|
---|