Changeset 14563 for branches/MemPRAlgorithm/HeuristicLab.Algorithms.MemPR/3.3/Permutation

Timestamp:

01/13/17 18:18:37 (8 years ago)

Author:

abeham

Message:

#2701:

• Tagged unbiased models with property
• Changed default configuration
• Added solution distance to breeding, relinking and delinking performance models
• Changed sampling model to base prediction on average distance in genotype space
• Changed target for hillclimber and relinking to relative (quality improvement)
• changed breeding to count cache hits per crossover

Location:

branches/MemPRAlgorithm/HeuristicLab.Algorithms.MemPR/3.3/Permutation

Files:

• PermutationMemPR.cs (modified) (11 diffs)
• SolutionModel/Univariate/BiasedModelTrainer.cs (modified) (2 diffs)
• SolutionModel/Univariate/UnbiasedModelTrainer.cs (modified) (2 diffs)

branches/MemPRAlgorithm/HeuristicLab.Algorithms.MemPR/3.3/Permutation/PermutationMemPR.cs

@@ -52 +52 @@
       foreach (var trainer in ApplicationManager.Manager.GetInstances<ISolutionModelTrainer<PermutationMemPRPopulationContext>>())
         SolutionModelTrainerParameter.ValidValues.Add(trainer);
-      
+
+      if (SolutionModelTrainerParameter.ValidValues.Count > 0) {
+        var unbiased = SolutionModelTrainerParameter.ValidValues.FirstOrDefault(x => !x.Bias);
+        if (unbiased != null) SolutionModelTrainerParameter.Value = unbiased;
+      }
+
       foreach (var localSearch in ApplicationManager.Manager.GetInstances<ILocalSearch<PermutationMemPRSolutionContext>>()) {
         LocalSearchParameter.ValidValues.Add(localSearch);
@@ -290 +295 @@
         InversionMove bestOfTheRest = null;
         var improved = false;
-
+        
         foreach (var opt in ExhaustiveInversionMoveGenerator.Generate(current).Shuffle(random)) {
           var prev = opt.Index1 - 1;
@@ -395 +400 @@
       cache.Add(p2.Solution);
 
-      var cacheHits = 0;
+      var cacheHits = new Dictionary<int, int>() { { 0, 0 }, { 1, 0 }, { 2, 0 } };
       var evaluations = 0;
       ISingleObjectiveSolutionScope<Encodings.PermutationEncoding.Permutation> offspring = null;
@@ -401 +406 @@
       while (evaluations < p1.Solution.Length) {
         Encodings.PermutationEncoding.Permutation c = null;
-        var xochoice = Context.Random.Next(3);
+        var xochoice = cacheHits.SampleRandom(Context.Random).Key;
         switch (xochoice) {
           case 0: c = CyclicCrossover2.Apply(Context.Random, p1.Solution, p2.Solution); break;
@@ -408 +413 @@
         }
         if (cache.Contains(c)) {
-          cacheHits++;
-          if (cacheHits > 10) break;
+          cacheHits[xochoice]++;
+          if (cacheHits[xochoice] > 10) {
+            cacheHits.Remove(xochoice);
+            if (cacheHits.Count == 0) break;
+          }
           continue;
         }
@@ -431 +439 @@
       cache.Add(p2.Solution);
 
-      var cacheHits = 0;
+      var cacheHits = new Dictionary<int, int>() { { 0, 0 }, { 1, 0 }, { 2, 0 } };
       var evaluations = 0;
       ISingleObjectiveSolutionScope<Encodings.PermutationEncoding.Permutation> offspring = null;
@@ -437 +445 @@
       while (evaluations < p1.Solution.Length) {
         Encodings.PermutationEncoding.Permutation c = null;
-        var xochoice = Context.Random.Next(3);
+        var xochoice = cacheHits.SampleRandom(Context.Random).Key;
         switch (xochoice) {
           case 0: c = OrderCrossover2.Apply(Context.Random, p1.Solution, p2.Solution); break;
@@ -444 +452 @@
         }
         if (cache.Contains(c)) {
-          cacheHits++;
-          if (cacheHits > 10) break;
+          cacheHits[xochoice]++;
+          if (cacheHits[xochoice] > 10) {
+            cacheHits.Remove(xochoice);
+            if (cacheHits.Count == 0) break;
+          }
           continue;
         }
@@ -467 +478 @@
       cache.Add(p2.Solution);
 
-      var cacheHits = 0;
+      var cacheHits = new Dictionary<int, int>() { { 0, 0 }, { 1, 0 }, { 2, 0 } };
       var evaluations = 0;
       ISingleObjectiveSolutionScope<Encodings.PermutationEncoding.Permutation> offspring = null;
@@ -473 +484 @@
       while (evaluations <= p1.Solution.Length) {
         Encodings.PermutationEncoding.Permutation c = null;
-        var xochoice = Context.Random.Next(3);
+        var xochoice = cacheHits.SampleRandom(Context.Random).Key;
         switch (xochoice) {
           case 0: c = OrderCrossover2.Apply(Context.Random, p1.Solution, p2.Solution); break;
@@ -480 +491 @@
         }
         if (cache.Contains(c)) {
-          cacheHits++;
-          if (cacheHits > 10) break;
+          cacheHits[xochoice]++;
+          if (cacheHits[xochoice] > 10) {
+            cacheHits.Remove(xochoice);
+            if (cacheHits.Count == 0) break;
+          }
           continue;
         }

branches/MemPRAlgorithm/HeuristicLab.Algorithms.MemPR/3.3/Permutation/SolutionModel/Univariate/BiasedModelTrainer.cs

@@ -25 +25 @@
 using HeuristicLab.Core;
 using HeuristicLab.Data;
-using HeuristicLab.Encodings.PermutationEncoding;
 using HeuristicLab.Optimization;
 using HeuristicLab.Parameters;
@@ -36 +35 @@
     where TContext : IPopulationBasedHeuristicAlgorithmContext<ISingleObjectiveHeuristicOptimizationProblem, Encodings.PermutationEncoding.Permutation>,
     ISolutionModelContext<Encodings.PermutationEncoding.Permutation>, IEvaluationServiceContext<Encodings.PermutationEncoding.Permutation> {
+
+    public bool Bias { get { return true; } }
 
     [Storable]

branches/MemPRAlgorithm/HeuristicLab.Algorithms.MemPR/3.3/Permutation/SolutionModel/Univariate/UnbiasedModelTrainer.cs

@@ -21 +21 @@
 
 using System.Linq;
-using HeuristicLab.Algorithms.MemPR.Binary.SolutionModel.Univariate;
 using HeuristicLab.Algorithms.MemPR.Interfaces;
 using HeuristicLab.Common;
 using HeuristicLab.Core;
-using HeuristicLab.Encodings.PermutationEncoding;
 using HeuristicLab.Optimization;
 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
@@ -35 +33 @@
     where TContext : IPopulationBasedHeuristicAlgorithmContext<ISingleObjectiveHeuristicOptimizationProblem, Encodings.PermutationEncoding.Permutation>,
     ISolutionModelContext<Encodings.PermutationEncoding.Permutation> {
-    
+
+    public bool Bias { get { return false; } }
+
     [StorableConstructor]
     protected UnbiasedModelTrainer(bool deserializing) : base(deserializing) { }