Index: /trunk/sources/HeuristicLab.SGA.Hardwired/3.3/CreateReplacement.cs
===================================================================
--- /trunk/sources/HeuristicLab.SGA.Hardwired/3.3/CreateReplacement.cs	(revision 1558)
+++ /trunk/sources/HeuristicLab.SGA.Hardwired/3.3/CreateReplacement.cs	(revision 1558)
@@ -0,0 +1,93 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * HeuristicLab is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+using System.Collections.Generic;
+using System.Text;
+using System.Linq;
+using HeuristicLab.Core;
+using HeuristicLab.Data;
+using HeuristicLab.Permutation;
+using HeuristicLab.Evolutionary;
+using HeuristicLab.Operators;
+using HeuristicLab.Routing.TSP;
+using HeuristicLab.Selection;
+using System.Collections;
+
+namespace HeuristicLab.SGA.Hardwired {
+  class CreateReplacement : OperatorBase {
+    LeftSelector ls;
+    RightReducer rr;
+    RightSelector rs;
+    LeftReducer lr;
+    MergingReducer mr;
+    Sorter sorter;
+
+    IRandom random;
+    DoubleData probability;
+
+    IList<OperatorBase> operators;
+
+    public override string Description {
+      get { return @"Implements the control structures of CreateReplacement hard wired. Operators are delegated."; }
+    }
+
+    public CreateReplacement()
+      : base() {
+      ls = new LeftSelector();
+      rr = new RightReducer();
+      rs = new RightSelector();
+      lr = new LeftReducer();
+      mr = new MergingReducer();
+      sorter = new Sorter();
+
+      sorter.GetVariableInfo("Descending").ActualName = "Maximization";
+      sorter.GetVariableInfo("Value").ActualName = "Quality";
+
+      ls.GetVariableInfo("Selected").ActualName = "Elites";
+      rs.GetVariableInfo("Selected").ActualName = "Elites";
+
+      // variables infos
+      //AddVariableInfo(new VariableInfo("Random", "Pseudo random number generator", typeof(IRandom), VariableKind.In));
+      //AddVariableInfo(new VariableInfo("Elites", "Number of selected sub-scopes", typeof(IntData), VariableKind.In));
+
+      operators = new List<OperatorBase>();
+      operators.Add(ls);
+      operators.Add(rr);
+      operators.Add(rs);
+      operators.Add(lr);
+    }
+
+    public override IOperation Apply(IScope scope) {
+      // SequentialSubScopesProcessor
+      ls.Execute(scope.SubScopes[0]);
+      rr.Execute(scope.SubScopes[0]);
+      
+      rs.Execute(scope.SubScopes[1]);
+      lr.Execute(scope.SubScopes[1]);
+
+      mr.Execute(scope);
+      sorter.Execute(scope);
+
+      return null;
+    } // Apply
+  } // class CreateReplacement
+} // namespace HeuristicLab.SGA.Hardwired
Index: /trunk/sources/HeuristicLab.SGA.Hardwired/3.3/CreateReplacementHardWired.cs
===================================================================
--- /trunk/sources/HeuristicLab.SGA.Hardwired/3.3/CreateReplacementHardWired.cs	(revision 1558)
+++ /trunk/sources/HeuristicLab.SGA.Hardwired/3.3/CreateReplacementHardWired.cs	(revision 1558)
@@ -0,0 +1,87 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * HeuristicLab is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+using System.Collections.Generic;
+using System.Text;
+using System.Linq;
+using HeuristicLab.Core;
+using HeuristicLab.Data;
+using HeuristicLab.Permutation;
+using HeuristicLab.Evolutionary;
+using HeuristicLab.Operators;
+using HeuristicLab.Routing.TSP;
+
+namespace HeuristicLab.SGA.Hardwired {
+  class CreateReplacementHardWired : OperatorBase {
+    ChildrenInitializer ci;
+    OperatorBase crossover;
+    OperatorBase mutator;
+    OperatorBase evaluator;
+    IRandom random;
+    DoubleData probability;
+
+    public override string Description {
+      get { return @"Implements the functionality CreateReplacement hard wired."; }
+    }
+
+    public CreateReplacementHardWired()
+      : base() {
+      ci = new ChildrenInitializer();
+
+      // variables infos
+      AddVariableInfo(new VariableInfo("Random", "Pseudo random number generator", typeof(IRandom), VariableKind.In));
+      AddVariableInfo(new VariableInfo("MutationRate", "Probability to choose first branch", typeof(DoubleData), VariableKind.In));
+      AddVariableInfo(new VariableInfo("Crossover", "Crossover strategy for SGA", typeof(OperatorBase), VariableKind.In));
+      AddVariableInfo(new VariableInfo("Mutator", "Mutation strategy for SGA", typeof(OperatorBase), VariableKind.In));
+      AddVariableInfo(new VariableInfo("Evaluator", "Evaluation strategy for SGA", typeof(OperatorBase), VariableKind.In));
+      AddVariableInfo(new VariableInfo("SubScopeIndex", "(Optional) the index of the subscope to remove", typeof(IntData), VariableKind.In));
+      AddVariableInfo(new VariableInfo("EvaluatedSolutions", "Number of evaluated solutions", typeof(IntData), VariableKind.In | VariableKind.Out));
+      AddVariableInfo(new VariableInfo("Maximization", "Sort in descending order", typeof(BoolData), VariableKind.In));
+      AddVariableInfo(new VariableInfo("Quality", "Sorting value", typeof(DoubleData), VariableKind.In));
+      GetVariableInfo("SubScopeIndex").Local = true;
+    }
+
+    public override IOperation Apply(IScope scope) {
+ 
+      // SequentialSubScopesProcessor
+      foreach (IScope s in scope.SubScopes) {
+        //sp2
+        //LeftSelector ls = new LeftSelector();
+        //ls.GetVariableInfo("Selected").ActualName = "Elites";
+        //RightReducer rr = new RightReducer();
+
+        //sp3
+        //RightSelector rs = new RightSelector();
+        //rs.GetVariableInfo("Selected").ActualName = "Elites";
+        //LeftReducer lr = new LeftReducer();
+
+        //MergingReducer mr = new MergingReducer();
+
+        //Sorter s = new Sorter();
+        //s.GetVariableInfo("Descending").ActualName = "Maximization";
+        //s.GetVariableInfo("Value").ActualName = "Quality";
+      } // foreach
+
+      return null;
+    } // Apply
+  } // class CreateReplacementHardWired
+} // namespace HeuristicLab.SGA.Hardwired
Index: /trunk/sources/HeuristicLab.SGA.Hardwired/3.3/HeuristicLab.SGA.Hardwired-3.3.csproj
===================================================================
--- /trunk/sources/HeuristicLab.SGA.Hardwired/3.3/HeuristicLab.SGA.Hardwired-3.3.csproj	(revision 1557)
+++ /trunk/sources/HeuristicLab.SGA.Hardwired/3.3/HeuristicLab.SGA.Hardwired-3.3.csproj	(revision 1558)
@@ -68,4 +68,6 @@
   </ItemGroup>
   <ItemGroup>
+    <Compile Include="CreateReplacement.cs" />
+    <Compile Include="CreateReplacementHardWired.cs" />
     <Compile Include="CreateChildrenHardWired.cs" />
     <Compile Include="HeuristicLabSGAHardwiredPlugin.cs" />
