Changeset 12288 for branches/LinearLinkage/HeuristicLab.Encodings.LinearLinkageEncoding/3.3/Crossovers/LowestIndexFirstCrossover.cs

Timestamp:

04/06/15 22:41:24 (10 years ago)

Author:

abeham

Message:

#2319:

• Changed encoding to represent linkages in LLE (as opposed to LLE-e)
• Added GraftManipulator
• Added repair procedure
• Improved performance of some crossovers

File:

• branches/LinearLinkage/HeuristicLab.Encodings.LinearLinkageEncoding/3.3/Crossovers/LowestIndexFirstCrossover.cs (modified) (1 diff)

branches/LinearLinkage/HeuristicLab.Encodings.LinearLinkageEncoding/3.3/Crossovers/LowestIndexFirstCrossover.cs

@@ -42 +42 @@
     public static LinearLinkage Apply(IRandom random, ItemArray<LinearLinkage> parents) {
       var len = parents[0].Length;
+      var p = random.Next(parents.Length);
       var child = new LinearLinkage(len);
-      var childGroup = new List<HashSet<int>>();
-      var currentParent = random.Next(parents.Length);
-      var remaining = new HashSet<int>(Enumerable.Range(0, len));
+      var remaining = new SortedSet<int>(Enumerable.Range(0, len));
       do {
-        var i = remaining.Min();
-        var group = new HashSet<int>(parents[currentParent].GetGroupForward(i));
-        group.IntersectWith(remaining);
-        childGroup.Add(group);
-        remaining.ExceptWith(group);
-        currentParent = (currentParent + 1) % parents.Length;
+        var i = remaining.Min;
+        foreach (var g in parents[p].GetGroupForward(i)) {
+          if (!remaining.Contains(g)) continue;
+          child[i] = g;
+          i = g;
+          remaining.Remove(g);
+        }
+        child[i] = i;
+        remaining.Remove(i);
+
+        p = (p + 1) % parents.Length;
       } while (remaining.Count > 0);
 
-      child.SetGroups(childGroup);
       return child;
     }