Changeset 17225 for branches/2521_ProblemRefactoring/HeuristicLab.Algorithms.MOCMAEvolutionStrategy/3.3/Indicators/MinimalDistanceIndicator.cs
- Timestamp:
- 08/29/19 13:53:26 (5 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2521_ProblemRefactoring/HeuristicLab.Algorithms.MOCMAEvolutionStrategy/3.3/Indicators/MinimalDistanceIndicator.cs
r16807 r17225 33 33 [StorableType("FBBD4517-164C-4DEE-B87D-49B99172EDF4")] 34 34 internal class MinimalDistanceIndicator : Item, IIndicator { 35 36 35 #region Constructor and Cloning 37 36 [StorableConstructor] 38 37 protected MinimalDistanceIndicator(StorableConstructorFlag _) : base(_) { } 39 38 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 } 41 42 public MinimalDistanceIndicator() { } 42 43 #endregion 43 44 44 public int LeastContributer(IReadOnlyList<Individual> front, MultiObjectiveProblem<RealVectorEncoding, RealVector>problem) {45 public int LeastContributer(IReadOnlyList<Individual> front, IMultiObjectiveProblemDefinition problem) { 45 46 var extracted = front.Select(x => x.PenalizedFitness).ToArray(); 46 47 if (extracted.Length <= 2) return 0; … … 88 89 var res = new double[extracted.Count, extracted.Count]; 89 90 for (var i = 0; i < extracted.Count; i++) 90 91 91 for (var j = 0; j < i; j++) 92 res[i, j] = res[j, i] = Dist(extracted[i], extracted[j]); 92 93 return res; 93 94 }
Note: See TracChangeset
for help on using the changeset viewer.