Changeset 16171 for branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ

Timestamp:

09/21/18 09:18:49 (6 years ago)

Author:

bwerth

Message:

#2943 worked on MOBasicProblem - added Interfaces;reworked MOCalculators; several minor changes

Location:

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ

Files:

• DTLZ.cs (modified) (1 diff)
• DTLZ1.cs (modified) (2 diffs)
• DTLZ2.cs (modified) (1 diff)
• DTLZ3.cs (modified) (1 diff)
• DTLZ4.cs (modified) (1 diff)
• DTLZ5.cs (modified) (2 diffs)
• DTLZ6.cs (modified) (2 diffs)
• DTLZ7.cs (modified) (2 diffs)
• DTLZ8.cs (modified) (5 diffs)

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ.cs

@@ -42 +42 @@
 
     protected override double[] GetReferencePoint(int objectives) {
-      double[] rp = new double[objectives];
-      for (int i = 0; i < objectives; i++) {
+      var rp = new double[objectives];
+      for (var i = 0; i < objectives; i++) {
         rp[i] = 11;
       }

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ1.cs

@@ -48 +48 @@
         throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
       }
-      double[] res = new double[objectives];
-      int k = r.Length - objectives + 1;
+      var res = new double[objectives];
+      var k = r.Length - objectives + 1;
       double g = 0;
 
-      for (int i = r.Length - k; i < r.Length; i++) {
+      for (var i = r.Length - k; i < r.Length; i++) {
         g += (r[i] - 0.5) * (r[i] - 0.5) - Math.Cos(20.0 * Math.PI * (r[i] - 0.5));
       };
@@ -58 +58 @@
       g *= 100;
 
-      for (int i = 0; i < objectives; i++) {
+      for (var i = 0; i < objectives; i++) {
         res[i] = 0.5 * (1.0 + g);
-        for (int j = 0; j < objectives - i - 1; ++j)
+        for (var j = 0; j < objectives - i - 1; ++j)
           res[i] *= (r[j]);
         if (i > 0)

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ2.cs

@@ -48 +48 @@
       }
 
-      double[] res = new double[objectives];
+      var res = new double[objectives];
 
       //calculate g(Xm)
       double g = 0;
-      for (int i = objectives; i < r.Length; i++) {
-        double d = r[i] - 0.5;
+      for (var i = objectives; i < r.Length; i++) {
+        var d = r[i] - 0.5;
         g += d * d;
       }
 
       //calculating f0...fM-1
-      for (int i = 0; i < objectives; i++) {
-        double f = i == 0 ? 1 : (Math.Sin(r[objectives - i - 1] * Math.PI / 2)) * (1 + g);
-        for (int j = 0; j < objectives - i - 1; j++) {
+      for (var i = 0; i < objectives; i++) {
+        var f = i == 0 ? 1 : (Math.Sin(r[objectives - i - 1] * Math.PI / 2)) * (1 + g);
+        for (var j = 0; j < objectives - i - 1; j++) {
           f *= Math.Cos(r[j] * Math.PI / 2);
         }

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ3.cs

@@ -47 +47 @@
         throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
       }
-      double[] res = new double[objectives];
+      var res = new double[objectives];
 
       //calculate g(Xm)
       double sum = 0;
-      int length = r.Length - objectives + 1;
-      for (int i = r.Length - length; i < r.Length; i++) {
-        double d = r[i] - 0.5;
+      var length = r.Length - objectives + 1;
+      for (var i = r.Length - length; i < r.Length; i++) {
+        var d = r[i] - 0.5;
         sum += d * d - Math.Cos(20 * Math.PI * d);
       }
-      double g = 100 * (length + sum);
+      var g = 100 * (length + sum);
 
       //calculating f0...fM-1
-      for (int i = 0; i < objectives; i++) {
-        double f = i == 0 ? 1 : (Math.Sin(r[objectives - i - 1] * Math.PI / 2)) * (1 + g);
-        for (int j = 0; j < objectives - i - 1; j++) {
+      for (var i = 0; i < objectives; i++) {
+        var f = i == 0 ? 1 : (Math.Sin(r[objectives - i - 1] * Math.PI / 2)) * (1 + g);
+        for (var j = 0; j < objectives - i - 1; j++) {
           f *= Math.Cos(r[j] * Math.PI / 2);
         }

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ4.cs

@@ -47 +47 @@
         throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
       }
-      double[] res = new double[objectives];
+      var res = new double[objectives];
 
       //calculate g(Xm)
       double g = 0;
-      for (int i = objectives; i < r.Length; i++) {
-        double d = r[i] - 0.5;
+      for (var i = objectives; i < r.Length; i++) {
+        var d = r[i] - 0.5;
         g += d * d;
       }
 
       //calculating f0...fM-1
-      for (int i = 0; i < objectives; i++) {
-        double f = i == 0 ? 1 : (Math.Sin(Math.Pow(r[objectives - i - 1], 100) * Math.PI / 2)) * (1 + g);
-        for (int j = 0; j < objectives - i - 1; j++) {
+      for (var i = 0; i < objectives; i++) {
+        var f = i == 0 ? 1 : (Math.Sin(Math.Pow(r[objectives - i - 1], 100) * Math.PI / 2)) * (1 + g);
+        for (var j = 0; j < objectives - i - 1; j++) {
           f *= Math.Cos(Math.Pow(r[j], 100) * Math.PI / 2);
         }

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ5.cs

@@ -42 +42 @@
         throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
       }
-      double[] res = new double[objectives];
+      var res = new double[objectives];
 
       //calculate g(Xm)
       double g = 0;
-      for (int i = objectives; i < r.Length; i++) {
-        double d = r[i] - 0.5;
+      for (var i = objectives; i < r.Length; i++) {
+        var d = r[i] - 0.5;
         g += d * d;
       }
@@ -56 +56 @@
 
       //calculating f0...fM-1
-      for (int i = 0; i < objectives; i++) {
-        double f = i == 0 ? 1 : (Math.Sin(phi(r[objectives - i - 1]) * Math.PI / 2)) * (1 + g);
-        for (int j = 0; j < objectives - i - 1; j++) {
+      for (var i = 0; i < objectives; i++) {
+        var f = i == 0 ? 1 : (Math.Sin(phi(r[objectives - i - 1]) * Math.PI / 2)) * (1 + g);
+        for (var j = 0; j < objectives - i - 1; j++) {
           f *= Math.Cos(phi(r[j]) * Math.PI / 2);
         }

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ6.cs

@@ -42 +42 @@
         throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
       }
-      double[] res = new double[objectives];
+      var res = new double[objectives];
 
       //calculate g(Xm)
       double g = 0;
-      for (int i = objectives; i < r.Length; i++) {
+      for (var i = objectives; i < r.Length; i++) {
         g += Math.Pow(r[i], 0.1);
       }
@@ -55 +55 @@
 
       //calculating f0...fM-1
-      for (int i = 0; i < objectives; i++) {
-        double f = i == 0 ? 1 : (Math.Sin(phi(r[objectives - i - 1]) * Math.PI / 2)) * (1 + g);
-        for (int j = 0; j < objectives - i - 1; j++) {
+      for (var i = 0; i < objectives; i++) {
+        var f = i == 0 ? 1 : (Math.Sin(phi(r[objectives - i - 1]) * Math.PI / 2)) * (1 + g);
+        for (var j = 0; j < objectives - i - 1; j++) {
           f *= Math.Cos(phi(r[j]) * Math.PI / 2);
         }

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ7.cs

@@ -47 +47 @@
         throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to the number of objectives");
       }
-      double[] res = new double[objectives];
+      var res = new double[objectives];
 
       //calculate g(Xm)
       double g = 0, length = length = r.Length - objectives + 1;
-      for (int i = objectives; i < r.Length; i++) {
+      for (var i = objectives; i < r.Length; i++) {
         g += r[i];
       }
@@ -58 +58 @@
 
       //calculating f0...fM-2
-      for (int i = 0; i < objectives - 1; i++) {
+      for (var i = 0; i < objectives - 1; i++) {
         res[i] = r[i];
       }
       //calculate fM-1
       double h = objectives;
-      for (int i = 0; i < objectives - 1; i++) {
+      for (var i = 0; i < objectives - 1; i++) {
         h -= res[i] / (1 + g) * (1 + Math.Sin(3 * Math.PI * res[i]));
       }

branches/2943_MOBasicProblem_MOCMAES/HeuristicLab.Problems.TestFunctions.MultiObjective/3.3/TestFunctions/DTLZ/DTLZ8.cs

@@ -30 +30 @@
   public class DTLZ8 : DTLZ, IConstrainedTestFunction {
     public static double[] IllegalValue(int size, bool[] maximization) {
-      double[] res = new double[size];
-      for (int i = 0; i < size; i++) {
+      var res = new double[size];
+      for (var i = 0; i < size; i++) {
         res[i] = maximization[i] ? Double.MinValue : Double.MaxValue;
       }
@@ -49 +49 @@
       double n = r.Length;
       double M = objectives;
-      double ratio = n / M;
-      double[] res = new double[objectives];
-      for (int j = 0; j < objectives; j++) {
+      var ratio = n / M;
+      var res = new double[objectives];
+      for (var j = 0; j < objectives; j++) {
         double sum = 0;
-        for (int i = (int)(j * ratio); i < (j + 1) + ratio; i++) {
+        for (var i = (int)(j * ratio); i < (j + 1) + ratio; i++) {
           sum += r[i];
         }
@@ -59 +59 @@
         res[j] = sum;
       }
-      for (int j = 0; j < M - 1; j++) {
+      for (var j = 0; j < M - 1; j++) {
         if (res[objectives - 1] + 4 * res[j] - 1 < 0) return IllegalValue(objectives, GetMaximization(objectives));
       }
-      double min = Double.PositiveInfinity;
-      for (int i = 0; i < res.Length - 1; i++) {
-        for (int j = 0; j < i; j++) {
-          double d = res[i] + res[j];
+      var min = Double.PositiveInfinity;
+      for (var i = 0; i < res.Length - 1; i++) {
+        for (var j = 0; j < i; j++) {
+          var d = res[i] + res[j];
           if (min < d) min = d;
         }
@@ -78 +78 @@
       double n = r.Length;
       double M = objectives;
-      double ratio = n / M;
-      double[] res = new double[objectives];
-      double[] constraints = new double[objectives];
-      for (int j = 0; j < objectives; j++) {
+      var ratio = n / M;
+      var res = new double[objectives];
+      var constraints = new double[objectives];
+      for (var j = 0; j < objectives; j++) {
         double sum = 0;
-        for (int i = (int)(j * ratio); i < (j + 1) + ratio; i++) {
+        for (var i = (int)(j * ratio); i < (j + 1) + ratio; i++) {
           sum += r[i];
         }
@@ -89 +89 @@
         res[j] = sum;
       }
-      for (int j = 0; j < M - 1; j++) {
-        double d1 = res[objectives - 1] + 4 * res[j] - 1;
+      for (var j = 0; j < M - 1; j++) {
+        var d1 = res[objectives - 1] + 4 * res[j] - 1;
         constraints[j] = d1 < 0 ? -d1 : 0;
       }
-      double min = Double.PositiveInfinity;
-      for (int i = 0; i < res.Length - 1; i++) {
-        for (int j = 0; j < i; j++) {
-          double d2 = res[i] + res[j];
+      var min = Double.PositiveInfinity;
+      for (var i = 0; i < res.Length - 1; i++) {
+        for (var j = 0; j < i; j++) {
+          var d2 = res[i] + res[j];
           if (min < d2) min = d2;
         }
       }
-      double d = 2 * res[objectives - 1] + min - 1;
+      var d = 2 * res[objectives - 1] + min - 1;
       constraints[constraints.Length - 1] = d < 0 ? -d : 0;
       return constraints;