Changeset 13385 for branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab-3.3/Samples/GAGroupingProblemSampleTest.cs

Timestamp:

11/24/15 18:22:29 (9 years ago)

Author:

abeham

Message:

#2521: fixed plugin dependencies and updated samples

File:

• branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab-3.3/Samples/GAGroupingProblemSampleTest.cs (modified) (3 diffs)

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab-3.3/Samples/GAGroupingProblemSampleTest.cs

@@ -45 +45 @@
 
 namespace HeuristicLab.Problems.Programmable {
-  public class CompiledSingleObjectiveProblemDefinition : CompiledProblemDefinition, ISingleObjectiveProblemDefinition {
+  public class CompiledSingleObjectiveProblemDefinition : CompiledSingleObjectiveProblemDefinition<LinearLinkageEncoding, LinearLinkage> {
     private const int ProblemSize = 100;
-    public bool Maximization { get { return false; } }
+    public override bool Maximization { get { return false; } }
 
     private bool[,] allowedTogether;
-      
+    
     public override void Initialize() {
-      var encoding = new LinearLinkageEncoding(""lle"", length: ProblemSize);
-      allowedTogether = new bool[encoding.Length, encoding.Length];
+      Encoding.Length = ProblemSize;
+      allowedTogether = new bool[ProblemSize, ProblemSize];
       var random = new System.Random(13);
-      for (var i = 0; i < encoding.Length - 1; i++)
-        for (var j = i + 1; j < encoding.Length; j++)
+      for (var i = 0; i < ProblemSize - 1; i++)
+        for (var j = i + 1; j < ProblemSize; j++)
           allowedTogether[i, j] = allowedTogether[j, i] = random.Next(2) == 0;
-      
-      Encoding = encoding;
     }
 
-    public double Evaluate(Individual individual, IRandom random) {
+    public override double Evaluate(LinearLinkage solution, IRandom random) {
       var penalty = 0;
-      var groups = individual.LinearLinkage(""lle"").GetGroups().ToList();
+      var groups = solution.GetGroups().ToList();
       for (var i = 0; i < groups.Count; i++) {
         for (var j = 0; j < groups[i].Count; j++)
@@ -74 +72 @@
     }
 
-    public void Analyze(Individual[] individuals, double[] qualities, ResultCollection results, IRandom random) { }
+    public override void Analyze(LinearLinkage[] solutions, double[] qualities, ResultCollection results, IRandom random) { }
 
-    public IEnumerable<Individual> GetNeighbors(Individual individual, IRandom random) {
-      foreach (var move in ExhaustiveSwap2MoveGenerator.Generate(individual.LinearLinkage(""lle""))) {
-        var neighbor = individual.Copy();
-        var lle = neighbor.LinearLinkage(""lle"");
-        Swap2MoveMaker.Apply(lle, move);
+    public override IEnumerable<LinearLinkage> GetNeighbors(LinearLinkage solution, IRandom random) {
+      foreach (var move in ExhaustiveSwap2MoveGenerator.Generate(solution)) {
+        var neighbor = (LinearLinkage)solution.Clone();
+        Swap2MoveMaker.Apply(neighbor, move);
         yield return neighbor;
       }
@@ -115 +112 @@
 
       #region Problem Configuration
-      var problem = new SingleObjectiveProgrammableProblem() {
+      var problem = new SingleObjectiveLinearLinkageProgrammableProblem() {
         ProblemScript = { Code = ProblemCode }
       };