1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022019 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 System;


23  using HeuristicLab.Common;


24  using HeuristicLab.Core;


25  using HeuristicLab.Optimization.Operators;


26  using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;


27 


28  namespace HeuristicLab.Encodings.LinearLinkageEncoding {


29  [Item("Hamming Similarity Calculator for LinearLinkage", "Calculates the hamming similarity for two linear linkage encoded solutions.")]


30  [StorableClass]


31  public sealed class HammingSimilarityCalculator : SingleObjectiveSolutionSimilarityCalculator {


32  protected override bool IsCommutative { get { return true; } }


33 


34  [StorableConstructor]


35  private HammingSimilarityCalculator(bool deserializing) : base(deserializing) { }


36  private HammingSimilarityCalculator(HammingSimilarityCalculator original, Cloner cloner) : base(original, cloner) { }


37  public HammingSimilarityCalculator() : base() { }


38 


39  public override IDeepCloneable Clone(Cloner cloner) {


40  return new HammingSimilarityCalculator(this, cloner);


41  }


42 


43  public static double CalculateSimilarity(LinearLinkage left, LinearLinkage right) {


44  if (left == null  right == null)


45  throw new ArgumentException("Cannot calculate similarity because one or both of the provided solutions is null.");


46  if (left.Length != right.Length)


47  throw new ArgumentException("Cannot calculate similarity because the provided solutions have different lengths.");


48  if (left.Length == 0)


49  throw new ArgumentException("Cannot calculate similarity because solutions are of length 0.");


50  if (ReferenceEquals(left, right)) return 1.0;


51 


52  var similarity = 0;


53  for (var i = 0; i < left.Length; i++) {


54  if (left[i] == right[i]) similarity++;


55  }


56  return similarity / (double)left.Length;


57  }


58 


59  public override double CalculateSolutionSimilarity(IScope leftSolution, IScope rightSolution) {


60  var left = leftSolution.Variables[SolutionVariableName].Value as LinearLinkage;


61  var right = rightSolution.Variables[SolutionVariableName].Value as LinearLinkage;


62 


63  return CalculateSimilarity(left, right);


64  }


65  }


66  }

