Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2521_ProblemRefactoring/HeuristicLab.Optimization/3.3/Interfaces/ISolutionSimilarityCalculator.cs @ 17356

Last change on this file since 17356 was 17226, checked in by mkommend, 5 years ago

#2521: Merged trunk changes into problem refactoring branch.

File size: 2.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 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
22using System.Collections.Generic;
23using HeuristicLab.Core;
24using HEAL.Attic;
25
26namespace HeuristicLab.Optimization {
27  [StorableType("03699efd-c957-4109-ad18-f98f6748bd91")]
28  /// <summary>
29  /// An interface which represents an operator for similarity calculation.
30  /// </summary>
31  public interface ISolutionSimilarityCalculator : IItem, IEqualityComparer<IScope> {
32    string SolutionVariableName { get; set; }
33    string QualityVariableName { get; set; }
34    bool ExecuteInParallel { get; set; }
35    int MaxDegreeOfParallelism { get; set; }
36
37    /// <summary>
38    /// Calculates the similarity of two solutions.
39    /// </summary>
40    /// <param name="leftSolution">The first scope that contains a solution.</param>
41    /// <param name="rightSolution">The second scope that contains a solution.</param>
42    /// <returns>A double between zero and one. Zero means the two solutions differ in every aspect, one indicates that the two solutions are the same.</returns>
43    double CalculateSolutionSimilarity(IScope leftSolution, IScope rightSolution);
44
45    /// <summary>
46    /// Calculates the similarity of solutions in one scope.
47    /// </summary>
48    /// <param name="solutionCrowd">The scope that contains solutions.</param>
49    /// <returns>A similarity matrix. Zero means the two solutions differ in every aspect, one indicates that the two solutions are the same.</returns>
50    double[][] CalculateSolutionCrowdSimilarity(IScope solutionCrowd);
51
52    /// <summary>
53    /// Calculates the similarity of solutions in two scopes.
54    /// </summary>
55    /// <param name="leftSolutionCrowd">The first scope that contains solutions.</param>
56    /// <param name="rightSolutionCrowd">The second scope that contains solutions.</param>
57    /// <returns>A similarity matrix. Zero means the two solutions differ in every aspect, one indicates that the two solutions are the same.</returns>
58    double[][] CalculateSolutionCrowdSimilarity(IScope leftSolutionCrowd, IScope rightSolutionCrowd);
59  }
60}
Note: See TracBrowser for help on using the repository browser.