Changeset 17686 for branches/2825-NSGA3/HeuristicLab.Algorithms.NSGA3/3.3/NSGA3.cs

Timestamp:

07/19/20 14:52:56 (4 years ago)

Author:

dleko

Message:

#2825 Add Generational Distance and Inverted Generational Distance to result page.

File:

• branches/2825-NSGA3/HeuristicLab.Algorithms.NSGA3/3.3/NSGA3.cs (modified) (4 diffs)

branches/2825-NSGA3/HeuristicLab.Algorithms.NSGA3/3.3/NSGA3.cs

@@ -80 +80 @@
         private const string GeneratedReferencePointsResultName = "Generated Reference Points";
         private const string CurrentGenerationResultName = "Generations";
+        private const string GenerationalDistanceResultName = "Generational Distance";
+        private const string InvertedGenerationalDistanceResultName = "Inverted Generational Distance";
         private const string ScatterPlotResultName = "Scatter Plot";
         private const string CurrentFrontResultName = "Pareto Front"; // Do not touch this
@@ -174 +176 @@
             get { return (IntValue)Results[CurrentGenerationResultName].Value; }
             set { Results[CurrentGenerationResultName].Value = value; }
+        }
+
+        public DoubleValue ResultsGenerationalDistance
+        {
+            get { return (DoubleValue)Results[GenerationalDistanceResultName].Value;}
+            set { Results[GenerationalDistanceResultName].Value = value; }
+        }
+
+        public DoubleValue ResultsInvertedGenerationalDistance
+        {
+            get { return (DoubleValue)Results[InvertedGenerationalDistanceResultName].Value; }
+            set { Results[InvertedGenerationalDistanceResultName].Value = value; }
         }
 
@@ -269 +283 @@
             Results.Add(new Result(CurrentFrontResultName, "The Pareto Front", new DoubleMatrix()));
             Results.Add(new Result(CurrentGenerationResultName, "The current generation", new IntValue(1)));
+            Results.Add(new Result(GenerationalDistanceResultName, "The generational distance to an optimal pareto front defined in the Problem", new DoubleValue(double.NaN)));
+            Results.Add(new Result(InvertedGenerationalDistanceResultName, "The inverted generational distance to an optimal pareto front defined in the Problem", new DoubleValue(double.NaN)));
             Results.Add(new Result(ScatterPlotResultName, "A scatterplot displaying the evaluated solutions and (if available) the analytically optimal front", new ParetoFrontScatterPlot()));
 
@@ -324 +340 @@
             ResultsScatterPlot = new ParetoFrontScatterPlot(solutions.Select(x => x.Fitness).ToArray(), solutions.Select(x => x.Chromosome.ToArray()).ToArray(), ResultsScatterPlot.ParetoFront, ResultsScatterPlot.Objectives, ResultsScatterPlot.ProblemSize);
             ResultsSolutions = solutions.Select(s => s.Chromosome.ToArray()).ToMatrix();
+
+            var problem = Problem as MultiObjectiveTestFunctionProblem;
+            if (problem == null) return;
+
+            ResultsGenerationalDistance = new DoubleValue(problem.BestKnownFront != null ? GenerationalDistance.Calculate(solutions.Select(s => s.Fitness), problem.BestKnownFront.ToJaggedArray(), 1) : double.NaN);
+            ResultsInvertedGenerationalDistance = new DoubleValue(problem.BestKnownFront != null ? InvertedGenerationalDistance.Calculate(solutions.Select(s => s.Fitness), problem.BestKnownFront.ToJaggedArray(), 1) : double.NaN);
+
             Problem.Analyze(
                 solutions.Select(s => (Individual)new SingleEncodingIndividual(Problem.Encoding, new Scope { Variables = { new Variable(Problem.Encoding.Name, s.Chromosome) } })).ToArray(),