Changeset 3404

Timestamp:

04/19/10 01:51:50 (14 years ago)

Author:

abeham

Message:

Added gender specific selection and ported the necessary operators RightChildReducer and SubScopesMixer #976

Location:

trunk/sources

Files:

• HeuristicLab.Operators/3.3/HeuristicLab.Operators-3.3.csproj (modified) (1 diff)
• HeuristicLab.Operators/3.3/SubScopesMixer.cs (modified) (5 diffs)
• HeuristicLab.Optimizer/3.3/HeuristicLab.Optimizer-3.3.csproj (modified) (1 diff)
• HeuristicLab.Selection/3.3/GenderSpecificSelector.cs (added)
• HeuristicLab.Selection/3.3/HeuristicLab.Selection-3.3.csproj (modified) (1 diff)
• HeuristicLab.Selection/3.3/RightChildReducer.cs (modified) (2 diffs)

trunk/sources/HeuristicLab.Operators/3.3/HeuristicLab.Operators-3.3.csproj

@@ -98 +98 @@
     <Compile Include="StochasticBranch.cs" />
     <Compile Include="SubScopesCreator.cs" />
+    <Compile Include="SubScopesMixer.cs" />
     <Compile Include="SubScopesProcessor.cs" />
     <Compile Include="SubScopesRemover.cs" />

trunk/sources/HeuristicLab.Operators/3.3/SubScopesMixer.cs

@@ -1 +1 @@
 #region License Information
 /* HeuristicLab
- * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
  *
  * This file is part of HeuristicLab.
@@ -21 +21 @@
 
 using System;
-using System.Collections.Generic;
-using System.Text;
 using HeuristicLab.Core;
 using HeuristicLab.Data;
+using HeuristicLab.Parameters;
+using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
 
 namespace HeuristicLab.Operators {
@@ -30 +30 @@
   /// Mixes the sub scopes of a specified scope according to a specified number of partitions.
   /// </summary>
-  public class SubScopesMixer : OperatorBase {
-    /// <inheritdoc select="summary"/>
-    public override string Description {
-      get { return @"TODO\r\nOperator description still missing ..."; }
+  [Item("SubScopesMixer", "Changes the order of the sub-scopes by repartitioning the sub-scopes such that each new partition contains one scope from each old partition.")]
+  [StorableClass]
+  public class SubScopesMixer : SingleSuccessorOperator {
+    public ValueParameter<IntValue> PartitionsParameter {
+      get { return (ValueParameter<IntValue>)Parameters["Partitions"]; }
     }
+
+    public IntValue Partitions {
+      get { return PartitionsParameter.Value; }
+      set { PartitionsParameter.Value = value; }
+    }
+
     /// <summary>
     /// Initializes a new instance of <see cref="SubScopesMixer"/> with one variable infos 
@@ -41 +48 @@
     public SubScopesMixer()
       : base() {
-      AddVariableInfo(new VariableInfo("Partitions", "Number of partitions to mix", typeof(IntData), VariableKind.In));
-      GetVariableInfo("Partitions").Local = true;
-      AddVariable(new Variable("Partitions", new IntData(2)));
+      Parameters.Add(new ValueParameter<IntValue>("Partitions", "The number of equal-sized partitions.", new IntValue(2)));
     }
 
     /// <summary>
-    /// Mixes the subscopes of the given <paramref name="scope"/>.
+    /// Mixes the sub-scopes of the scope this operator is applied on.
     /// </summary>
-    /// <remarks>Calls <see cref="IScope.ReorderSubScopes"/>.<br/>
-    /// Mixing of sub scopes is based on the number of partitions.
-    /// <example>12 sub scopes and 3 partitions:<br/>
-    /// Partition 1 contains sub scopes 1-4, partition 2 sub scopes 5-8 and partition 3 sub scopes 9-12. <br/>
-    /// Mixing is realized by selecting at the beginning the first sub scope from partition one, then the 
-    /// first sub scope from partition 2, afterwards first sub scope from partition 3, 
-    /// then the second sub scope from the first partition and so on. <br/>
+    /// <remarks>Mixing of sub-scopes is based on the number of partitions.
+    /// <example>12 sub-scopes and 3 partitions:<br/>
+    /// Partition 1 contains scopes 1-4, partition 2 scopes 5-8 and partition 3 scopes 9-12. <br/>
+    /// Mixing is realized by selecting at the beginning the first scope from partition one, then the 
+    /// first scope from partition 2, afterwards first scope from partition 3, 
+    /// then the second scope from the first partition and so on. <br/>
     /// In the end the new sorting of the sub scopes is 1-5-9-2-6-10-3-7-11-4-8-12. 
     /// </example>
@@ -63 +67 @@
     /// <param name="scope">The scope whose sub scopes should be mixed.</param>
     /// <returns><c>null</c>.</returns>
-    public override IOperation Apply(IScope scope) {
-      int partitions = GetVariableValue<IntData>("Partitions", scope, true).Data;
-      int[] sequence = new int[scope.SubScopes.Count];
-      if ((sequence.Length % partitions) != 0)
-        throw new ArgumentException("The number of subScopes is not divisible by the number of partitions without remainder.");
-      int partitionSize = sequence.Length / partitions;
+    public override IOperation Apply() {
+      int partitions = Partitions.Value;
+      IScope scope = ExecutionContext.Scope;
+      int count = scope.SubScopes.Count;
+      if ((count % partitions) != 0)
+        throw new ArgumentException(Name + ": The number of sub-scopes is not divisible by the number of partitions without remainder.");
+      int partitionSize = count / partitions;
+
+      IScope[] reorderedSubScopes = new IScope[count];
 
       // mix sub-scopes -> alternately take one sub-scope from each partition
       for (int i = 0; i < partitionSize; i++) {
-        for (int j = 0; j < partitions; j++)
-          sequence[i * partitions + j] = j * partitionSize + i;
+        for (int j = 0; j < partitions; j++) {
+          reorderedSubScopes[i * partitions + j] = scope.SubScopes[j * partitionSize + i];
+        }
       }
-      scope.ReorderSubScopes(sequence);
+      scope.SubScopes.Clear();
+      scope.SubScopes.AddRange(reorderedSubScopes);
 
-      return null;
+      return base.Apply();
     }
   }

trunk/sources/HeuristicLab.Optimizer/3.3/HeuristicLab.Optimizer-3.3.csproj

@@ -139 +139 @@
     <None Include="app.config" />
     <EmbeddedResource Include="Documents\FirstSteps.rtf" />
-    <EmbeddedResource Include="Documents\LS_OneMax.hl" />
-    <EmbeddedResource Include="Documents\SA_Rastrigin.hl" />
-    <EmbeddedResource Include="Documents\TS_TSP.hl" />
     <None Include="HeuristicLab.snk" />
     <None Include="Properties\AssemblyInfo.frame" />

trunk/sources/HeuristicLab.Selection/3.3/HeuristicLab.Selection-3.3.csproj

@@ -83 +83 @@
     <None Include="HeuristicLabSelectionPlugin.cs.frame" />
     <Compile Include="BestSelector.cs" />
+    <Compile Include="GenderSpecificSelector.cs" />
+    <Compile Include="RightChildReducer.cs" />
     <Compile Include="SingleObjectiveSelector.cs" />
     <Compile Include="LeftReducer.cs" />

trunk/sources/HeuristicLab.Selection/3.3/RightChildReducer.cs

@@ -1 +1 @@
 #region License Information
 /* HeuristicLab
- * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
  *
  * This file is part of HeuristicLab.
@@ -20 +20 @@
 #endregion
 
-using System;
 using System.Collections.Generic;
-using System.Text;
 using HeuristicLab.Core;
-using HeuristicLab.Operators;
+using HeuristicLab.Optimization;
+using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
 
 namespace HeuristicLab.Selection {
   /// <summary>
-  /// Reduces the sub scopes by one level, so that the right sub scope contains also the right child scopes
-  /// of the left sub scope and the left sub scope represents its left child scope.
+  /// Reduces the sub-scopes, so that the selected sub-scope contains all selected leaves (1) and (2)
+  /// and the remaining sub-scope contains the sub-scopes of the bottom-most remaining scope (3).
   /// <pre>                                                      
-  ///                   scope             scope  
-  ///                   / | \             /   \      
-  ///                  L ... R   =>      A     R                 
-  ///                / | \    \              / /\ \       
-  ///               A ... LR   C             C D E F      
-  ///                     /|\                              
-  ///                    D E F                             
+  ///                  scope            scope  
+  ///                   / \             /   \      
+  ///                  R   S(1)   =>   R     S                 
+  ///                 / \     \       /|\   /|\       
+  ///               R(3) S(2)  C     ABCDEF  CDEF      
+  ///               /|\  /|\                              
+  ///             ABCDEF DEF                             
   /// </pre>
   /// </summary>
-  public class RightChildReducer : ReducerBase {
-    /// <inheritdoc select="summary"/>
-    public override string Description {
-      get { return @"TODO\r\nOperator description still missing ..."; }
-    }
-
+  [Item("RightChildReducer", "Merges all sub-scopes generated by successively selecting sub-scopes of the remaining part.")]
+  [StorableClass]
+  public class RightChildReducer : Reducer, IReducer {
     /// <summary>
-    /// Reduces the right child of the left sub scope and adds its sub scopes to the right sub scope.
-    /// The left sub scope is also narrowed, which means it represents then its left child.
+    ///  Reduces the sub-scopes, so that the selected sub-scope contains all selected leaves
+    /// and the remaining sub-scope contains the sub-scopes of the bottom-most remaining scope.
     /// </summary>
     /// <param name="scope">The current scope to reduce.</param>
     /// <returns>A list of the new reduced sub scopes.</returns>
-    protected override ICollection<IScope> Reduce(IScope scope) {
-      IScope rightChild = scope.SubScopes[scope.SubScopes.Count - 1];
-      IScope leftChild = scope.SubScopes[0];
-      IScope leftRightChild = leftChild.SubScopes[leftChild.SubScopes.Count - 1];
+    protected override List<IScope> Reduce(List<IScope> scopes) {
+      IScope rightChild = scopes[scopes.Count - 1];
+      IScope leftChild = scopes[0];
+      while (leftChild.SubScopes.Count > 1 && leftChild.SubScopes[0].SubScopes.Count > 0) {
+        IScope leftRightChild = leftChild.SubScopes[leftChild.SubScopes.Count - 1];
 
-      // merge right children
-      for (int i = 0; i < leftRightChild.SubScopes.Count; i++)
-        rightChild.AddSubScope(leftRightChild.SubScopes[i]);
+        // merge right children
+        while (leftRightChild.SubScopes.Count > 0)
+          rightChild.SubScopes.Add(leftRightChild.SubScopes[0]);
 
-      leftChild = leftChild.SubScopes[0];
-
+        leftChild = leftChild.SubScopes[0];
+      }
       List<IScope> subScopes = new List<IScope>();
       subScopes.Add(leftChild);