Changeset 11753 for branches/ProgrammableProblem/HeuristicLab.Problems.Programmable/3.3/New/Scripts/SingleObjectiveProblemDefinitionScript.cs

Timestamp:

01/13/15 18:47:19 (9 years ago)

Author:

mkommend

Message:

#2174: First working version of refactored programmable problem.

File:

• branches/ProgrammableProblem/HeuristicLab.Problems.Programmable/3.3/New/Scripts/SingleObjectiveProblemDefinitionScript.cs (modified) (6 diffs)

branches/ProgrammableProblem/HeuristicLab.Problems.Programmable/3.3/New/Scripts/SingleObjectiveProblemDefinitionScript.cs

@@ -20 +20 @@
 #endregion
 
-using System;
 using System.Collections.Generic;
 using HeuristicLab.Common;
@@ -26 +25 @@
 using HeuristicLab.Optimization;
 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
+using HeuristicLab.Problems.Programmable.New.Scripts.Templates;
 
 namespace HeuristicLab.Problems.Programmable {
@@ -34 +34 @@
 
     protected override string CodeTemplate {
-      get {
-        return @"using System;
-using System.Linq;
-using System.Collections.Generic;
-using HeuristicLab.Common;
-using HeuristicLab.Core;
-using HeuristicLab.Data;
-using HeuristicLab.Encodings.PermutationEncoding;
-using HeuristicLab.Optimization;
-using HeuristicLab.Problems.Programmable;
+      get { return ScriptTemplates.CompiledSingleObjectiveProblemDefinition; }
+    }
 
-public class CustomProblemDefinition : CompiledProblemDefinition, ISingleObjectiveProblemDefinition {
-  public bool IsMaximizationProblem { get { return false; } }
-
-  public CustomProblemDefinition() {
-    // Define the solution encoding which can also consist of multiple vectors, examples below
-    // Encoding = new BinaryEncoding(""b"", length: 5);
-    // Encoding = new IntegerEncoding(""i"", lenght: 5, min: 2, max: 14, step: 4);
-    // Encoding = new RealEncoding(""r"", length: 5, min: -1.0, max: 1.0);
-    // Encoding = new PermutationEncoding(""P"", length: 5, type: PermutationTypes.Absolute);
-    // Encoding = new MultiEncoding()
-      // .AddBinaryVector(""b"", length: 5)
-      // .AddIntegerVector(""i"", length: 5, min: 2, max: 14, step: 4)
-      // .AddRealVector(""r"", length: 5, min: -1.0, max: 1.0)
-      // .AddPermutation(""P"", length: 5, type: PermutationTypes.Absolute)
-    ;
-  }
-
-  public override void Initialize() {
-    // when the definition is created here you can initialize variables in the variable store
-  }
-
-  public double Evaluate(IRandom random, Individual individual) {
-    var quality = 0.0;
-    // use vars.yourVariable to access variables in the variable store i.e. yourVariable
-    // quality = individual.RealVector(""r"").Sum(x => x * x);
-    return quality;
-  }
-
-  public void Analyze(Individual[] individuals, double[] qualities, ResultCollection results) {
-    // write or update results given the range of vectors and resulting qualities
-    // use e.g. vars.yourVariable to access variables in the variable store i.e. yourVariable
-  }
-
-  public override IEnumerable<Individual> GetNeighbors(IRandom random, Individual individual) {
-    // Create new vectors, based on the given one that represent small changes
-    // This method is only called from move-based algorithms (LocalSearch, SimulatedAnnealing, etc.)
-    while (true) {
-      // this is not an infinite loop as only a finite amount of samples will be drawn
-      // it is possible to return a concrete amount of neighbors also
-      var neighbor = (Individual)individual.Clone();
-      //e.g. make a bit flip in a binary parameter
-      //var bIndex = random.Next(neighbor.BinaryVector(""b"").Length);
-      //neighbor.BinaryVector(""b"")[bIndex] = !neighbor.BinaryVector(""b"")[bIndex];
-      yield return neighbor;
-    }
-  }
-
-  // implement further classes and methods
-}";
-      }
+    private new ISingleObjectiveProblemDefinition CompiledProblemDefinition {
+      get { return (ISingleObjectiveProblemDefinition)base.CompiledProblemDefinition; }
     }
 
@@ -100 +44 @@
     private SingleObjectiveProblemDefinitionScript(bool deserializing) : base(deserializing) { }
     private SingleObjectiveProblemDefinitionScript(SingleObjectiveProblemDefinitionScript original, Cloner cloner) : base(original, cloner) { }
-    public SingleObjectiveProblemDefinitionScript() :base(){
+    public SingleObjectiveProblemDefinitionScript()
+      : base() {
       Code = CodeTemplate;
     }
@@ -108 +53 @@
     }
 
-    public new ISingleObjectiveProblemDefinition CompiledProblemDefinition {
-      get { return (ISingleObjectiveProblemDefinition)base.CompiledProblemDefinition; }
-    }
-
     bool ISingleObjectiveProblemDefinition.Maximization {
-      get { return CompiledProblemDefinition != null && CompiledProblemDefinition.Maximization; }
+      get { return CompiledProblemDefinition.Maximization; }
     }
 
@@ -123 +64 @@
       CompiledProblemDefinition.Analyze(individuals, qualities, results);
     }
+    IEnumerable<Individual> ISingleObjectiveProblemDefinition.GetNeighbors(Individual individual, IRandom random) {
+      return CompiledProblemDefinition.GetNeighbors(individual, random);
+    }
   }
 }