Changeset 13776

Timestamp:

04/20/16 10:29:06 (9 years ago)

Author:

bwerth

Message:

#1087 added ConstrainedFunctions

Location:

branches/HeuristicLab.Problems.MultiObjectiveTestFunctions

Files:

• .vs/MultiObjectiveTestFunctions/v14/.suo (modified) (previous)
• HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Calculators/HyperVolume.cs (modified) (1 diff)
• HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/EmbeddedRessources/CF1.pf (added)
• HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/HeuristicLab.Problems.MultiObjectiveTestFunctions-3.3.csproj (modified) (2 diffs)
• HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Interfaces/IConstrainedTestFunction.cs (copied) (copied from branches/HeuristicLab.Problems.MultiObjectiveTestFunctions/HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Interfaces/IMultiObjectiveTestFunction.cs) (2 diffs)
• HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/MultiObjectiveTestFunctionProblem.cs (modified) (1 diff)
• HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Testfunctions/CF1.cs (added)
• HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Testfunctions/DTLZ/DTLZ8.cs (modified) (3 diffs)

branches/HeuristicLab.Problems.MultiObjectiveTestFunctions/HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Calculators/HyperVolume.cs

@@ -57 +57 @@
       double[][] set = front.ToArray();   //Still no Good
       if (set.Length == 0) throw new ArgumentException("Fronts must not be empty");
+      if (refp.Length != set.Length) throw new ArgumentException("Front and referencepoint need to be of the same dimensionality");
       Array.Sort<double[]>(set, Utilities.getDimensionComparer(0, maximization[0]));
       double[] last = set[set.Length - 1];

branches/HeuristicLab.Problems.MultiObjectiveTestFunctions/HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/HeuristicLab.Problems.MultiObjectiveTestFunctions-3.3.csproj

@@ -154 +154 @@
     <Compile Include="Data\DTLZInstanceProvider.cs" />
     <Compile Include="Interfaces\IMOFrontModel.cs" />
+    <Compile Include="Testfunctions\CF1.cs" />
     <Compile Include="Views\MOSolution.cs" />
     <Compile Include="Views\MOFrontScatterPlotView.cs">
@@ -204 +205 @@
     <EmbeddedResource Include="EmbeddedRessources\ZDT4.pf" />
     <EmbeddedResource Include="EmbeddedRessources\ZDT6.pf" />
+    <EmbeddedResource Include="EmbeddedRessources\CF1.pf" />
     <None Include="HeuristicLab.snk" />
     <None Include="Plugin.cs.frame" />

branches/HeuristicLab.Problems.MultiObjectiveTestFunctions/HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Interfaces/IConstrainedTestFunction.cs

@@ -20 +20 @@
 #endregion
 
-using System.Collections.Generic;
 using HeuristicLab.Core;
 using HeuristicLab.Encodings.RealVectorEncoding;
@@ -28 +27 @@
   /// An interface which represents an evaluation operator for multi objective test functions.
   /// </summary>
-  public interface IMultiObjectiveTestFunction : INamedItem {
-    bool[] Maximization(int objectives);
-    double[,] Bounds(int objectives);
-    IEnumerable<double[]> OptimalParetoFront(int objectives);
-    double[] ReferencePoint(int objectives);
-    double BestKnownHypervolume(int objectives);
+  public interface IConstrainedTestFunction : INamedItem {
 
-    int MinimumSolutionLength { get; }
-    int MaximumSolutionLength { get; }
-    int MinimumObjectives { get; }
-    int MaximumObjectives { get; }
-
-    double[] Evaluate(RealVector point, int objectives);
+    /// <summary>
+    /// checks whether a given solution violates the contraints of this function  
+    /// </summary>
+    /// <param name="point"></param>
+    /// <param name="objectives"></param>
+    /// <returns>a double array that holds the distances that describe how much every contraint is violated (0 is not violated) </returns>
+    double[] CheckConstraints(RealVector point, int objectives);
   }
 }

branches/HeuristicLab.Problems.MultiObjectiveTestFunctions/HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/MultiObjectiveTestFunctionProblem.cs

@@ -167 +167 @@
     }
 
+
+    /// <summary>
+    /// Checks whether a given solution violates the contraints of this function.
+    /// </summary>
+    /// <param name="individual"></param>
+    /// <returns>a double array that holds the distances that describe how much every contraint is violated (0 is not violated). If the current TestFunction does not have constraints an array of length 0 is returned</returns>
+    public double[] checkContraints(RealVector individual) {
+      if (TestFunction is IConstrainedTestFunction) {
+        return ((IConstrainedTestFunction)TestFunction).CheckConstraints(individual, Objectives);
+      }
+      return new double[0];
+    }
+
     public double[] Evaluate(RealVector individual, IRandom random) {
       return TestFunction.Evaluate(individual, Objectives);

branches/HeuristicLab.Problems.MultiObjectiveTestFunctions/HeuristicLab.Problems.MultiObjectiveTestFunctions/3.3/Testfunctions/DTLZ/DTLZ8.cs

@@ -26 +26 @@
 
 namespace HeuristicLab.Problems.MultiObjectiveTestFunctions {
-  [Item("DTLZ8", "Testfunction as defined as DTLZ7 in http://repository.ias.ac.in/81671/ [30.11.15]")]
+  [Item("DTLZ8", "Testfunction as defined as DTLZ7 in http://repository.ias.ac.in/81671/ [30.11.15]. There has been a renumbering therefore the numbers do not match")]
   [StorableClass]
-  public class DTLZ8 : DTLZ {
+  public class DTLZ8 : DTLZ, IConstrainedTestFunction {
 
 
@@ -38 +38 @@
     }
     public DTLZ8() : base() { }
-
-    public double[] Evaluate2(RealVector r, int objectives) {
-      if (r.Length < objectives) {
-        throw new ArgumentException("The dimensionality of the problem(ProblemSize) must be larger than or equal to ten times the number of objectives ");
-      }
-      double[] res = new double[objectives];
-
-      //calculate f0...fM-1;
-      double n = 10 * objectives;
-      for (int i = 1; i <= objectives; i++) {
-        double d = 0;
-        int c = 0;
-        for (int j = (int)Math.Floor((i - 1) * n / objectives); j < Math.Min((int)Math.Floor(i * n / objectives), r.Length); j++) {
-          d += r[j];
-          c++;
-        }
-        if (c != 0) {
-          d *= 1.0 / c;
-        }
-        res[i - 1] = d;
-      }
-
-      //evaluate constraints g0...gM-2
-      for (int i = 0; i < objectives - 1; i++) {
-        if (res[objectives - 1] + 4 * res[i] - 1 < 0) return MultiObjectiveTestFunction.IllegalValue(objectives, Maximization(objectives));
-      }
-      //evaluate gM-1
-      double min = Double.PositiveInfinity;
-      for (int i = 0; i < objectives - 1; i++) {
-        for (int j = 0; j < i; j++) min = Math.Min(min, res[i] + res[j]);
-      };
-      if (2 * res[objectives - 1] + min - 1 < 0) return MultiObjectiveTestFunction.IllegalValue(objectives, Maximization(objectives));
-
-      return res;
-    }
-
 
     public override double[] Evaluate(RealVector r, int objectives) {
@@ -104 +68 @@
     }
 
-
+    double[] IConstrainedTestFunction.CheckConstraints(RealVector r, int objectives) {
+      if (r.Length < 10 * objectives) throw new Exception("The dimensionality of the problem(ProblemSize) must be larger than ten times the number of objectives ");
+      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++) {
+        double sum = 0;
+        for (int i = (int)(j * ratio); i < (j + 1) + ratio; i++) {
+          sum += r[i];
+        }
+        sum /= (int)ratio;
+        res[j] = sum;
+      }
+      for (int j = 0; j < M - 1; j++) {
+        double 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];
+          if (min < d2) min = d2;
+        }
+      }
+      double d = 2 * res[objectives - 1] + min - 1;
+      constraints[constraints.Length - 1] = d < 0 ? -d : 0;
+      return constraints;
+    }
   }
 }