Changeset 17315 for branches/2521_ProblemRefactoring/HeuristicLab.Algorithms.MOCMAEvolutionStrategy/3.3/MOCMAEvolutionStrategy.cs
- Timestamp:
- 10/04/19 14:23:08 (5 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2521_ProblemRefactoring/HeuristicLab.Algorithms.MOCMAEvolutionStrategy/3.3/MOCMAEvolutionStrategy.cs
r17309 r17315 376 376 var bkf = problem.BestKnownFront == null ? null : problem.BestKnownFront.ToArray(); 377 377 if (bkf != null && problem.ReferencePoint != null) { 378 ResultsBestKnownHypervolume = HypervolumeCalculator.CalculateHypervolume(bkf, problem.ReferencePoint, Problem.Maximization .CloneAsArray());378 ResultsBestKnownHypervolume = HypervolumeCalculator.CalculateHypervolume(bkf, problem.ReferencePoint, Problem.Maximization); 379 379 ResultsDifferenceBestKnownHypervolume = ResultsBestKnownHypervolume; 380 380 } … … 456 456 //perform a non-dominated sort to assign the rank to every element 457 457 int[] ranks; 458 var fronts = DominationCalculator.CalculateAllParetoFronts(parents.ToArray(), parents.Select(i => i.PenalizedFitness).ToArray(), Problem.Maximization .CloneAsArray(), out ranks);458 var fronts = DominationCalculator.CalculateAllParetoFronts(parents.ToArray(), parents.Select(i => i.PenalizedFitness).ToArray(), Problem.Maximization, out ranks); 459 459 460 460 //deselect the highest rank fronts until we would end up with less or equal mu elements
Note: See TracChangeset
for help on using the changeset viewer.