Changeset 11880 for branches/ProgrammableProblem/HeuristicLab.Problems.Programmable/3.3/New/Scripts/Templates/CompiledSingleObjectiveProblemDefinition.cs

Timestamp:

02/04/15 00:03:14 (9 years ago)

Author:

abeham

Message:

#2174:

• Added IImprovmentOperator interface to SingleObjectiveImprover
• Added Random parameter to Analyze method and IStochasticOperator interface to the resp. analyzer
• Updated code template text of the compiled single- and multi-objective problem definitions
• Prevent ProblemDefinitionScript from silently ignoring exceptions
• Added equality comparer in Encoding's cloning constructor
• Small adaption of ProblemDefinitionScriptView to changes in new code editor

File:

• branches/ProgrammableProblem/HeuristicLab.Problems.Programmable/3.3/New/Scripts/Templates/CompiledSingleObjectiveProblemDefinition.cs (modified) (3 diffs)

branches/ProgrammableProblem/HeuristicLab.Problems.Programmable/3.3/New/Scripts/Templates/CompiledSingleObjectiveProblemDefinition.cs

@@ -14 +14 @@
 
     public override void Initialize() {
+      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
       // Define the solution encoding which can also consist of multiple vectors, examples below
       //Encoding = new BinaryEncoding("b", length: 5);
-      //Encoding = new IntegerEncoding("i", length: 5, min: 2, max: 14, step: 4);
+      //Encoding = new IntegerEncoding("i", length: 5, min: 2, max: 14, step: 2);
       //Encoding = new RealEncoding("r", length: 5, min: -1.0, max: 1.0);
       //Encoding = new PermutationEncoding("p", length: 5, type: PermutationTypes.Absolute);
-
+      // The encoding can also be a combination
       //Encoding = new MultiEncoding()
       //.Add(new BinaryEncoding("b", length: 5))
@@ -25 +26 @@
       //.Add(new RealEncoding("r", length: 5, min: -1.0, max: 1.0))
       //.Add(new PermutationEncoding("p", length: 5, type: PermutationTypes.Absolute))
-      //;
+      ;
+      // Add additional initialization code e.g. private variables that you need for evaluating
     }
 
     public double Evaluate(Individual individual, IRandom random) {
+      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
       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 void Analyze(Individual[] individuals, double[] qualities, ResultCollection results, IRandom random) {
+      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
+      // Write or update results given the range of vectors and resulting qualities
+      // Uncomment the following lines if you want to retrieve the best individual
+      //var bestIndex = Maximization ?
+      //         qualities.Select((v, i) => Tuple.Create(i, v)).OrderByDescending(x => x.Item2).First().Item1
+      //       : qualities.Select((v, i) => Tuple.Create(i, v)).OrderBy(x => x.Item2).First().Item1;
+      //var best = individuals[bestIndex];
     }
 
     public IEnumerable<Individual> GetNeighbors(Individual individual, IRandom random) {
+      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
       // Create new vectors, based on the given one that represent small changes
-      // This method is only called from move-based algorithms (LocalSearch, SimulatedAnnealing, etc.)
+      // This method is only called from move-based algorithms (Local Search, Simulated Annealing, 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
+        // Algorithm will draw only a finite amount of samples
+        // Change to a for-loop to return a concrete amount of neighbors
         var neighbor = individual.Copy();
-        //e.g. make a bit flip in a binary parameter
+        // For instance, perform a single bit-flip in a binary parameter
         //var bIndex = random.Next(neighbor.BinaryVector("b").Length);
         //neighbor.BinaryVector("b")[bIndex] = !neighbor.BinaryVector("b")[bIndex];
@@ -54 +62 @@
     }
 
-    // implement further classes and methods
+    // Implement further classes and methods
   }
 }