Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
11/24/15 17:27:35 (9 years ago)
Author:
abeham
Message:

#2521: adapted templates, fixed missing reference in outdated plugin lawnmower

Location:
branches/ProblemRefactoring/HeuristicLab.Problems.Programmable/3.3/Templates
Files:
1 added
1 edited
2 copied
2 moved

Legend:

Unmodified
Added
Removed

  • branches/ProblemRefactoring/HeuristicLab.Problems.Programmable/3.3/Templates/MultiObjectiveCombinedEncodingProblem_Template.cs

    r13363 r13373  
    55using HeuristicLab.Core;
    66using HeuristicLab.Data;
    7 using ENCODING_NAMESPACE;
    87using HeuristicLab.Optimization;
    98using HeuristicLab.Problems.Programmable;
     9//using HeuristicLab.Encodings.BinaryVectorEncoding;
     10//using HeuristicLab.Encodings.IntegerVectorEncoding;
     11//using HeuristicLab.Encodings.RealVectorEncoding;
     12//using HeuristicLab.Encodings.PermutationEncoding;
     13//using HeuristicLab.Encodings.LinearLinkageEncoding;
     14//using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
    1015
    1116namespace HeuristicLab.Problems.Programmable {
    12   public class CompiledSingleObjectiveProblemDefinition : CompiledMultiObjectiveProblemDefinition<ENCODING_CLASS, SOLUTION_CLASS> {
    13     public override bool[] Maximization { get { return new[] { false, false }; } }
     17  public class CompiledSingleObjectiveProblemDefinition : CompiledMultiObjectiveProblemDefinition<CombinedEncoding, CombinedSolution> {
     18    public override bool[] Maximization { get { return new[] { true, false }; } }
    1419
    1520    public override void Initialize() {
    … …  
    1722      // Define e.g. the length of the solution encoding or the solution creator by modifying the Encoding property
    1823      // Add additional initialization code e.g. private variables that you need for evaluating
     24      //Encoding.Add(new BinaryVectorEncoding("b") { Length = 10 });
     25      //Encoding.Add(new IntegerVectorEncoding("i") { Length = 10, Bounds = new int[,] { { -100, 100 } } });
     26      //Encoding.Add(new RealVectorEncoding("r") { Length = 10, Bounds = new double[,] { { -100, 100 } } });
     27      //Encoding.Add(new PermutationEncoding("p") { Length = 20, PermutationType = PermutationTypes.Absolute });
     28      //Encoding.Add(new LinearLinkageEncoding("lle") { Length = 30 });
     29      //Encoding.Add(new SymbolicExpressionTreeEncoding("tree") { ... });
    1930    }
    2031
    21     public override double[] Evaluate(SOLUTION_CLASS solution, IRandom random) {
     32    public override double[] Evaluate(CombinedSolution solution, IRandom random) {
    2233      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    2334      var quality = new[] { 0.0, 0.0 };
     35      // var b = solution.GetSolution<BinaryVector>("b");
     36      // quality[0] = b.Count(x => x); // one max!
     37      // var r = solution.GetSolution<RealVector>("r");
     38      // quality[1] = r.Select((i, v) => new { Idx = i, Val = v }).Sum(x => b[x.Idx] ? x.Val * x.Val : 0.0); // sphere
     39
     40      // NOTE: Check the Maximization property above (true or false)!
    2441      return quality;
    2542    }
    2643
    27     public override void Analyze(SOLUTION_CLASS[] solution, double[][] qualities, ResultCollection results, IRandom random) {
     44    public override void Analyze(CombinedSolution[] solutions, double[][] qualities, ResultCollection results, IRandom random) {
    2845      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    2946      // Write or update results given the range of vectors and resulting qualities
    30       // Uncomment the following lines if you want to retrieve the best individual
    31 
    32       //var orderedIndividuals = individuals.Zip(qualities, (i, q) => new { Individual = i, Quality = q }).OrderBy(z => z.Quality);
    33       //var best = Maximization ? orderedIndividuals.Last().Individual : orderedIndividuals.First().Individual;
    34 
    35       //if (!results.ContainsKey("Best Solution")) {
    36       //  results.Add(new Result("Best Solution", typeof(SOLUTION_CLASS)));
    37       //}
    38       //results["Best Solution"].Value = (IItem)best.Clone();
     47      // Uncomment the following lines if you want to retrieve the best solution
    3948    }
    4049
    41     public override IEnumerable<SOLUTION_CLASS> GetNeighbors(SOLUTION_CLASS individual, IRandom random) {
     50    public override IEnumerable<CombinedSolution> GetNeighbors(CombinedSolution solution, IRandom random) {
    4251      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    4352      // Create new vectors, based on the given one that represent small changes
    … …  
    4655        // Algorithm will draw only a finite amount of samples
    4756        // Change to a for-loop to return a concrete amount of neighbors
    48         var neighbor = (SOLUTION_CLASS)individual.Clone();
     57        var neighbor = (CombinedSolution)solution.Clone();
    4958        // modify the solution specified as neighbor
    5059        yield return neighbor;

  • branches/ProblemRefactoring/HeuristicLab.Problems.Programmable/3.3/Templates/MultiObjectiveProblem_Template.cs

    r13372 r13373  
    1616      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    1717      // Define e.g. the length of the solution encoding or the solution creator by modifying the Encoding property
     18      // Encoding.Length = 100;
    1819      // Add additional initialization code e.g. private variables that you need for evaluating
    1920    }
    … …  
    2526    }
    2627
    27     public override void Analyze(SOLUTION_CLASS[] solution, double[][] qualities, ResultCollection results, IRandom random) {
     28    public override void Analyze(SOLUTION_CLASS[] solutions, double[][] qualities, ResultCollection results, IRandom random) {
    2829      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    2930      // Write or update results given the range of vectors and resulting qualities
    30       // Uncomment the following lines if you want to retrieve the best individual
    31 
    32       //var orderedIndividuals = individuals.Zip(qualities, (i, q) => new { Individual = i, Quality = q }).OrderBy(z => z.Quality);
    33       //var best = Maximization ? orderedIndividuals.Last().Individual : orderedIndividuals.First().Individual;
    34 
    35       //if (!results.ContainsKey("Best Solution")) {
    36       //  results.Add(new Result("Best Solution", typeof(SOLUTION_CLASS)));
    37       //}
    38       //results["Best Solution"].Value = (IItem)best.Clone();
    3931    }
    4032
    41     public override IEnumerable<SOLUTION_CLASS> GetNeighbors(SOLUTION_CLASS individual, IRandom random) {
     33    public override IEnumerable<SOLUTION_CLASS> GetNeighbors(SOLUTION_CLASS solution, IRandom random) {
    4234      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    4335      // Create new vectors, based on the given one that represent small changes
    … …  
    4638        // Algorithm will draw only a finite amount of samples
    4739        // Change to a for-loop to return a concrete amount of neighbors
    48         var neighbor = (SOLUTION_CLASS)individual.Clone();
     40        var neighbor = (SOLUTION_CLASS)solution.Clone();
    4941        // modify the solution specified as neighbor
    5042        yield return neighbor;

  • branches/ProblemRefactoring/HeuristicLab.Problems.Programmable/3.3/Templates/ScriptTemplates.resx

    r13348 r13373  
    119119  </resheader>
    120120  <assembly alias="System.Windows.Forms" name="System.Windows.Forms, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089" />
    121   <data name="CompiledMultiObjectiveProblemDefinition_Template" type="System.Resources.ResXFileRef, System.Windows.Forms">
    122     <value>CompiledMultiObjectiveProblemDefinition_Template.cs;System.String, mscorlib, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089;utf-8</value>
     121  <data name="MultiObjectiveCombinedEncodingProblem_Template" type="System.Resources.ResXFileRef, System.Windows.Forms">
     122    <value>MultiObjectiveCombinedEncodingProblem_Template.cs;System.String, mscorlib, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089;utf-8</value>
    123123  </data>
    124   <data name="CompiledSingleObjectiveProblemDefinition_Template" type="System.Resources.ResXFileRef, System.Windows.Forms">
    125     <value>CompiledSingleObjectiveProblemDefinition_Template.cs;System.String, mscorlib, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089;utf-8</value>
     124  <data name="MultiObjectiveProblem_Template" type="System.Resources.ResXFileRef, System.Windows.Forms">
     125    <value>MultiObjectiveProblem_Template.cs;System.String, mscorlib, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089;utf-8</value>
     126  </data>
     127  <data name="SingleObjectiveCombinedEncodingProblem_Template" type="System.Resources.ResXFileRef, System.Windows.Forms">
     128    <value>SingleObjectiveCombinedEncodingProblem_Template.cs;System.String, mscorlib, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089;utf-8</value>
     129  </data>
     130  <data name="SingleObjectiveProblem_Template" type="System.Resources.ResXFileRef, System.Windows.Forms">
     131    <value>SingleObjectiveProblem_Template.cs;System.String, mscorlib, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089;utf-8</value>
    126132  </data>
    127133</root>

  • branches/ProblemRefactoring/HeuristicLab.Problems.Programmable/3.3/Templates/SingleObjectiveCombinedEncodingProblem_Template.cs

    r13363 r13373  
    55using HeuristicLab.Core;
    66using HeuristicLab.Data;
    7 using ENCODING_NAMESPACE;
    87using HeuristicLab.Optimization;
    98using HeuristicLab.Problems.Programmable;
     9//using HeuristicLab.Encodings.BinaryVectorEncoding;
     10//using HeuristicLab.Encodings.IntegerVectorEncoding;
     11//using HeuristicLab.Encodings.RealVectorEncoding;
     12//using HeuristicLab.Encodings.PermutationEncoding;
     13//using HeuristicLab.Encodings.LinearLinkageEncoding;
     14//using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
    1015
    1116namespace HeuristicLab.Problems.Programmable {
    12   public class CompiledSingleObjectiveProblemDefinition : CompiledSingleObjectiveProblemDefinition<ENCODING_CLASS, SOLUTION_CLASS> {
    13     public override bool Maximization { get { return false; } }
     17  public class CompiledSingleObjectiveProblemDefinition : CompiledSingleObjectiveProblemDefinition<CombinedEncoding, CombinedSolution> {
     18    public override bool Maximization { get { return true; } }
    1419
    1520    public override void Initialize() {
    … …  
    1722      // Define e.g. the length of the solution encoding or the solution creator by modifying the Encoding property
    1823      // Add additional initialization code e.g. private variables that you need for evaluating
     24      //Encoding.Add(new BinaryVectorEncoding("b") { Length = 10 });
     25      //Encoding.Add(new IntegerVectorEncoding("i") { Length = 10, Bounds = new int[,] { { -100, 100 } } });
     26      //Encoding.Add(new RealVectorEncoding("r") { Length = 10, Bounds = new double[,] { { -100, 100 } } });
     27      //Encoding.Add(new PermutationEncoding("p") { Length = 20, PermutationType = PermutationTypes.Absolute });
     28      //Encoding.Add(new LinearLinkageEncoding("lle") { Length = 30 });
     29      //Encoding.Add(new SymbolicExpressionTreeEncoding("tree") { ... });
    1930    }
    2031
    21     public override double Evaluate(SOLUTION_CLASS solution, IRandom random) {
     32    public override double Evaluate(CombinedSolution solution, IRandom random) {
    2233      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    2334      var quality = 0.0;
     35      // var b = solution.GetSolution<BinaryVector>("b");
     36      // quality = b.Count(x => x); // one max!
     37      // var r = solution.GetSolution<RealVector>("r");
     38      // quality += r.Sum(x => -x * x); // sphere
     39
     40      // NOTE: Check the Maximization property above (true or false)!
    2441      return quality;
    2542    }
    2643
    27     public override void Analyze(SOLUTION_CLASS[] solution, double[] qualities, ResultCollection results, IRandom random) {
     44    public override void Analyze(CombinedSolution[] solutions, double[] qualities, ResultCollection results, IRandom random) {
    2845      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    2946      // Write or update results given the range of vectors and resulting qualities
    30       // Uncomment the following lines if you want to retrieve the best individual
     47      // Uncomment the following lines if you want to retrieve the best solution
    3148
    32       //var orderedIndividuals = individuals.Zip(qualities, (i, q) => new { Individual = i, Quality = q }).OrderBy(z => z.Quality);
    33       //var best = Maximization ? orderedIndividuals.Last().Individual : orderedIndividuals.First().Individual;
     49      //var orderedSolutions = solutions.Zip(qualities, (i, q) => new { Solution = i, Quality = q }).OrderBy(z => z.Quality);
     50      //var best = Maximization ? orderedSolutions.Last().Solution : orderedSolutions.First().Solution;
    3451
    3552      //if (!results.ContainsKey("Best Solution")) {
    … …  
    3956    }
    4057
    41     public override IEnumerable<SOLUTION_CLASS> GetNeighbors(SOLUTION_CLASS individual, IRandom random) {
     58    public override IEnumerable<CombinedSolution> GetNeighbors(CombinedSolution solution, IRandom random) {
    4259      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    4360      // Create new vectors, based on the given one that represent small changes
    … …  
    4663        // Algorithm will draw only a finite amount of samples
    4764        // Change to a for-loop to return a concrete amount of neighbors
    48         var neighbor = (SOLUTION_CLASS)individual.Clone();
     65        var neighbor = (CombinedSolution)solution.Clone();
    4966        // modify the solution specified as neighbor
    5067        yield return neighbor;

  • branches/ProblemRefactoring/HeuristicLab.Problems.Programmable/3.3/Templates/SingleObjectiveProblem_Template.cs

    r13363 r13373  
    1616      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    1717      // Define e.g. the length of the solution encoding or the solution creator by modifying the Encoding property
     18      // Encoding.Length = 100;
    1819      // Add additional initialization code e.g. private variables that you need for evaluating
    1920    }
    … …  
    2526    }
    2627
    27     public override void Analyze(SOLUTION_CLASS[] solution, double[] qualities, ResultCollection results, IRandom random) {
     28    public override void Analyze(SOLUTION_CLASS[] solutions, double[] qualities, ResultCollection results, IRandom random) {
    2829      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    2930      // Write or update results given the range of vectors and resulting qualities
    30       // Uncomment the following lines if you want to retrieve the best individual
     31      // Uncomment the following lines if you want to retrieve the best solution
    3132
    32       //var orderedIndividuals = individuals.Zip(qualities, (i, q) => new { Individual = i, Quality = q }).OrderBy(z => z.Quality);
    33       //var best = Maximization ? orderedIndividuals.Last().Individual : orderedIndividuals.First().Individual;
     33      //var orderedSolutions = solutions.Zip(qualities, (i, q) => new { Solution = i, Quality = q }).OrderBy(z => z.Quality);
     34      //var best = Maximization ? orderedSolutions.Last().Solution : orderedSolutions.First().Solution;
    3435
    3536      //if (!results.ContainsKey("Best Solution")) {
    … …  
    3940    }
    4041
    41     public override IEnumerable<SOLUTION_CLASS> GetNeighbors(SOLUTION_CLASS individual, IRandom random) {
     42    public override IEnumerable<SOLUTION_CLASS> GetNeighbors(SOLUTION_CLASS solution, IRandom random) {
    4243      // Use vars.yourVariable to access variables in the variable store i.e. yourVariable
    4344      // Create new vectors, based on the given one that represent small changes
    … …  
    4647        // Algorithm will draw only a finite amount of samples
    4748        // Change to a for-loop to return a concrete amount of neighbors
    48         var neighbor = (SOLUTION_CLASS)individual.Clone();
     49        var neighbor = (SOLUTION_CLASS)solution.Clone();
    4950        // modify the solution specified as neighbor
    5051        yield return neighbor;
Note: See TracChangeset for help on using the changeset viewer.