Changeset 8267

Timestamp:

07/10/12 00:10:14 (12 years ago)

Author:

ascheibe

Message:

#1886 added wild card analyzer for the best individual

Location:

branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior/3.3

Files:

• AlgorithmBehaviorHelpers.cs (modified) (2 diffs)
• Analyzers/BestIndividualSchemataAnalyzer.cs (modified) (1 diff)
• Analyzers/BestIndividualWildcardAnalyzer.cs (added)
• Creators/BestIndividualWildcardCreator.cs (added)
• Creators/WildcardsCreator.cs (modified) (2 diffs)
• HeuristicLab.Analysis.AlgorithmBehavior-3.3.csproj (modified) (1 diff)

branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior/3.3/AlgorithmBehaviorHelpers.cs

@@ -20 +20 @@
 #endregion
 
+using System;
 using System.Collections.Generic;
 using System.Linq;
@@ -57 +58 @@
     }
 
+    public static IList<IntArray> GenerateWildcardSchemata(IntArray schema) {
+      string formatString = "{0:d" + schema.Length + "}";
+      var combs = new List<bool[]>();
+      string comb = string.Empty;
+
+      // create all desired wildcard combinations
+      long i = 0;
+      int wildcardCount = 0; // first wildcard combination contains no wildcards
+      while (wildcardCount < schema.Length) {
+        wildcardCount = (comb = Convert.ToString(i++, 2)).PadLeft(schema.Length, '0').Count(x => x == '1');
+        if (wildcardCount > (schema.Length / 8) && wildcardCount < (schema.Length / 2)) // only include wildcards within certain limits
+          combs.Add(comb.Select(x => x == '1').ToArray()); // '1' becomes true which indicates a wildcard
+      }
+
+      // create all desired wildcard instances
+      var wildcardSchemata = new List<IntArray>();
+      foreach (var c in combs) {
+        wildcardSchemata.Add(new IntArray(schema.Select((x, index) => c[index] ? -1 : x).ToArray())); // -1 is a wildcard in the schema
+      }
+
+      return wildcardSchemata;
+    }
+
     public static string CalculateBrokenInheritanceOccurrences(IntArray schema, GenealogyGraphNode individual) {
       ISet<int> generations = new SortedSet<int>();

branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior/3.3/Analyzers/BestIndividualSchemataAnalyzer.cs

@@ -79 +79 @@
         var graph = (GenealogyGraph<Permutation>)Results[PopulationGraphResultName].Value;
         int maxGen = (int)graph.Values.Max(x => x.Rank.Max()); // find last generation
+        SchemaEqualityComparer comparer = new SchemaEqualityComparer();
+
+        double curMaxGen = maxGen;
+        IEnumerable<GenealogyGraphNode> lastGen = null;
+        IEnumerable<GenealogyGraphNode> parents = null;
+        lastGen = graph.Values.Where(x => x.Rank.Contains(curMaxGen));
+        parents = lastGen.Where(x => comparer.Equals((IntArray)x.Data, schemata.Last()));
+
+        while (parents.Count() == 0) {
+          lastGen = graph.Values.Where(x => x.Rank.Contains(curMaxGen));
+          parents = lastGen.Where(x => comparer.Equals((IntArray)x.Data, schemata.Last()));
+          curMaxGen -= 0.5;
+        }
+        var bestIndividual = parents.First();
+        var ancestors = parents.First().Ancestors().Where(x => AlgorithmBehaviorHelpers.IsSubtour(schemata.Last(), (Permutation)x.Data));
+
+
 
         // locate best individual in graph
-        var bestIndividual = graph.Values.First(x => x.Rank.Max() == maxGen && AlgorithmBehaviorHelpers.IsMatch(new IntArray(((Permutation)x.Data).ToArray()), (schemata.Last()).ToArray()));
+        /*GenealogyGraphNode bestIndividual = null;
+        try {
+          var parents = lastGen.Where(x => comparer.Equals((IntArray)x.Data, parent));
+          bestIndividual = graph.Values.First(x => x.Rank.Max() == maxGen && AlgorithmBehaviorHelpers.IsMatch(new IntArray(((Permutation)x.Data).ToArray()), (schemata.Last()).ToArray()));
+        }
+        catch (Exception ex) {
+          ex.ToString();
+        } */
         var bestSchemata = schemata.Take(schemata.Count() - 1);
 
         // group ancestors by generation
-        var generations = new IList<GenealogyGraphNode>[maxGen + 1];
+        var generations = new IList<GenealogyGraphNode>[((int)maxGen) + 1];
         for (int i = 0; i <= maxGen; i++)
           generations[i] = bestIndividual.Ancestors().Where(x => x.Rank.Contains(i) || x.Rank.Contains(i - 0.5)).ToList();

branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior/3.3/Creators/WildcardsCreator.cs

@@ -20 +20 @@
 #endregion
 
-using System;
 using System.Collections.Generic;
-using System.Linq;
 using HeuristicLab.Common;
 using HeuristicLab.Core;
@@ -77 +75 @@
       var wildcards = new List<IntArray>();
       foreach (var schema in schemata) {
-        wildcards.AddRange(GenerateWildcardSchemata(schema));
+        wildcards.AddRange(AlgorithmBehaviorHelpers.GenerateWildcardSchemata(schema));
       }
 
       Results.Add(new Result(WildcardsResultName, new ItemArray<IntArray>(wildcards)));
-
       return base.Apply();
-    }
-
-    private IList<IntArray> GenerateWildcardSchemata(IntArray schema) {
-      string formatString = "{0:d" + schema.Length + "}";
-      var combs = new List<bool[]>();
-      string comb = string.Empty;
-
-      // create all desired wildcard combinations
-      int i = 0;
-      int wildcardCount = 0; // first wildcard combination contains no wildcards
-      while (wildcardCount < schema.Length) {
-        wildcardCount = (comb = string.Format(formatString, Convert.ToInt32(Convert.ToString(i++, 2)))).Count(x => x == '1');
-        if (wildcardCount > schema.Length / 8 && wildcardCount <= schema.Length / 2) // only include wildcards within certain limits
-          combs.Add(comb.Select(x => x == '1').ToArray()); // '1' becomes true which indicates a wildcard
-      }
-
-      // create all desired wildcard instances
-      var wildcardSchemata = new List<IntArray>();
-      foreach (var c in combs) {
-        wildcardSchemata.Add(new IntArray(schema.Select((x, index) => c[index] ? -1 : x).ToArray())); // -1 is a wildcard in the schema
-      }
-
-      return wildcardSchemata;
     }
   }

branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior/3.3/HeuristicLab.Analysis.AlgorithmBehavior-3.3.csproj

@@ -99 +99 @@
     <Compile Include="Analyzers\BrokenInheritanceWildcardAnalyzer.cs" />
     <Compile Include="Analyzers\BrokenInteritanceSchemaAnalyzer.cs" />
+    <Compile Include="Analyzers\BestIndividualWildcardAnalyzer.cs" />
     <Compile Include="Creators\BestIndividualSchemataCreator.cs" />
     <Compile Include="Analyzers\BestIndividualQualityAnalyzer.cs" />
     <Compile Include="Analyzers\SchemaOccurenceInGenerationsAnalyzer.cs" />
     <Compile Include="Analyzers\SchemaQualityAnalyzer.cs" />
+    <Compile Include="Creators\BestIndividualWildcardCreator.cs" />
     <Compile Include="Creators\SchemataCreator.cs" />
     <Compile Include="Creators\WildcardsCreator.cs" />