Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
08/29/19 13:53:26 (5 years ago)
Author:
mkommend
Message:

#2521: Integrated changes of #2943 into problem refactoring branch.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • branches/2521_ProblemRefactoring/HeuristicLab.Algorithms.MOCMAEvolutionStrategy/3.3/Indicators/MinimalDistanceIndicator.cs

    r16807 r17225  
    3333  [StorableType("FBBD4517-164C-4DEE-B87D-49B99172EDF4")]
    3434  internal class MinimalDistanceIndicator : Item, IIndicator {
    35 
    3635    #region Constructor and Cloning
    3736    [StorableConstructor]
    3837    protected MinimalDistanceIndicator(StorableConstructorFlag _) : base(_) { }
    3938    protected MinimalDistanceIndicator(MinimalDistanceIndicator original, Cloner cloner) : base(original, cloner) { }
    40     public override IDeepCloneable Clone(Cloner cloner) { return new MinimalDistanceIndicator(this, cloner); }
     39    public override IDeepCloneable Clone(Cloner cloner) {
     40      return new MinimalDistanceIndicator(this, cloner);
     41    }
    4142    public MinimalDistanceIndicator() { }
    4243    #endregion
    4344
    44     public int LeastContributer(IReadOnlyList<Individual> front, MultiObjectiveProblem<RealVectorEncoding, RealVector> problem) {
     45    public int LeastContributer(IReadOnlyList<Individual> front, IMultiObjectiveProblemDefinition problem) {
    4546      var extracted = front.Select(x => x.PenalizedFitness).ToArray();
    4647      if (extracted.Length <= 2) return 0;
     
    8889      var res = new double[extracted.Count, extracted.Count];
    8990      for (var i = 0; i < extracted.Count; i++)
    90         for (var j = 0; j < i; j++)
    91           res[i, j] = res[j, i] = Dist(extracted[i], extracted[j]);
     91      for (var j = 0; j < i; j++)
     92        res[i, j] = res[j, i] = Dist(extracted[i], extracted[j]);
    9293      return res;
    9394    }
Note: See TracChangeset for help on using the changeset viewer.