Changeset 9709 for branches/CMAES/HeuristicLab.Algorithms.CMAEvolutionStrategy/3.3/CMAOperators/CMAMutator.cs

Timestamp:

07/16/13 15:32:29 (11 years ago)

Author:

abeham

Message:

#1961: implemented reviewer comments

File:

• branches/CMAES/HeuristicLab.Algorithms.CMAEvolutionStrategy/3.3/CMAOperators/CMAMutator.cs (modified) (5 diffs)

branches/CMAES/HeuristicLab.Algorithms.CMAEvolutionStrategy/3.3/CMAOperators/CMAMutator.cs

@@ -73 +73 @@
     }
 
-    public IValueParameter<IntValue> MaxTriesParameter {
-      get { return (IValueParameter<IntValue>)Parameters["MaxTries"]; }
+    public IFixedValueParameter<IntValue> MaxTriesParameter {
+      get { return (IFixedValueParameter<IntValue>)Parameters["MaxTries"]; }
+    }
+
+    public IFixedValueParameter<BoolValue> TruncateAtBoundsParameter {
+      get { return (IFixedValueParameter<BoolValue>)Parameters["TruncateAtBounds"]; }
     }
     #endregion
@@ -91 +95 @@
       Parameters.Add(new ValueLookupParameter<DoubleMatrix>("Bounds", "The bounds for the dimensions."));
       Parameters.Add(new LookupParameter<CMAParameters>("StrategyParameters", "The CMA-ES strategy parameters used for mutation."));
-      Parameters.Add(new ValueParameter<IntValue>("MaxTries", "The maximum number of tries a mutation should be performed if it was outside the bounds.", new IntValue(1000)));
+      Parameters.Add(new FixedValueParameter<IntValue>("MaxTries", "The maximum number of tries a mutation should be performed if it was outside the bounds.", new IntValue(100)));
+      Parameters.Add(new FixedValueParameter<BoolValue>("TruncateAtBounds", "Whether the point should be truncated at the bounds if none of the tries resulted in a point within the bounds.", new BoolValue(true)));
     }
 
@@ -100 +105 @@
     public override IOperation Apply() {
       var maxTries = MaxTriesParameter.Value.Value;
+      var truncateAtBounds = TruncateAtBoundsParameter.Value.Value;
       var random = RandomParameter.ActualValue;
       var lambda = PopulationSizeParameter.ActualValue.Value;
@@ -128 +134 @@
               if (!inRange) tries++;
             } while (!inRange && tries < maxTries);
-            if (!inRange && maxTries > 1) {
+            if (!inRange && truncateAtBounds) {
               if (bounds[k % bounds.Rows, 0] > arx[i][k]) arx[i][k] = bounds[k % bounds.Rows, 0];
               else if (bounds[k % bounds.Rows, 1] < arx[i][k]) arx[i][k] = bounds[k % bounds.Rows, 1];
@@ -152 +158 @@
             }
           } while (!inRange && tries < maxTries);
-          if (!inRange && maxTries > 1) {
+          if (!inRange && truncateAtBounds) {
             for (int k = 0; k < length; k++) {
               if (bounds[k % bounds.Rows, 0] > arx[i][k]) arx[i][k] = bounds[k % bounds.Rows, 0];