Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.GP.Operators/3.3/Initialization/ProbabilisticTreeCreator.cs @ 2566

Last change on this file since 2566 was 2566, checked in by gkronber, 14 years ago

Added new predefined function libraries for symbolic regression algorithms. Changed CEDMA dispatcher to choose a function library randomly. #813 (GP structure-identification algorithms that use only a simple function library)

File size: 3.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using HeuristicLab.Core;
23using HeuristicLab.Data;
24using HeuristicLab.Random;
25using HeuristicLab.GP.Interfaces;
26
27namespace HeuristicLab.GP.Operators {
28  public class ProbabilisticTreeCreator : OperatorBase {
29    private static int MAX_TRIES { get { return 100; } }
30
31    public override string Description {
32      get { return @"Generates a new random operator tree."; }
33    }
34
35    public ProbabilisticTreeCreator()
36      : base() {
37      AddVariableInfo(new VariableInfo("Random", "Uniform random number generator", typeof(MersenneTwister), VariableKind.In));
38      AddVariableInfo(new VariableInfo("FunctionLibrary", "The function library containing all available functions", typeof(FunctionLibrary), VariableKind.In));
39      AddVariableInfo(new VariableInfo("MinTreeSize", "The minimal allowed size of the tree", typeof(IntData), VariableKind.In));
40      AddVariableInfo(new VariableInfo("MaxTreeSize", "The maximal allowed size of the tree", typeof(IntData), VariableKind.In));
41      AddVariableInfo(new VariableInfo("MaxTreeHeight", "The maximal allowed height of the tree", typeof(IntData), VariableKind.In));
42      AddVariableInfo(new VariableInfo("FunctionTree", "The created tree", typeof(IGeneticProgrammingModel), VariableKind.New | VariableKind.Out));
43    }
44
45    public override IOperation Apply(IScope scope) {
46      IRandom random = GetVariableValue<IRandom>("Random", scope, true);
47      FunctionLibrary funLibrary = GetVariableValue<FunctionLibrary>("FunctionLibrary", scope, true);
48      int minTreeSize = GetVariableValue<IntData>("MinTreeSize", scope, true).Data;
49      int maxTreeSize = GetVariableValue<IntData>("MaxTreeSize", scope, true).Data;
50      int maxTreeHeight = GetVariableValue<IntData>("MaxTreeHeight", scope, true).Data;
51
52      IFunctionTree root = Create(random, funLibrary, minTreeSize, maxTreeSize, maxTreeHeight);
53      scope.AddVariable(new HeuristicLab.Core.Variable(scope.TranslateName("FunctionTree"), new GeneticProgrammingModel(root)));
54      return Util.CreateInitializationOperation(TreeGardener.GetAllSubTrees(root), scope);
55    }
56
57
58    public static IFunctionTree Create(IRandom random, FunctionLibrary funLib, int minSize, int maxSize, int maxHeight) {
59      int treeSize = random.Next(minSize, maxSize);
60      IFunctionTree root;
61      int tries = 0;
62      TreeGardener gardener = new TreeGardener(random, funLib);
63      do {
64        root = gardener.PTC2(treeSize, maxHeight);
65        if (tries++ >= MAX_TRIES) {
66          // try a different size
67          treeSize = random.Next(minSize, maxSize);
68          tries = 0;
69        }
70      } while (root.GetSize() > maxSize || root.GetHeight() > maxHeight);
71      return root;
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.