[645] | 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 |
|
---|
| 22 | using System.Linq;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using System;
|
---|
| 27 | using HeuristicLab.Random;
|
---|
| 28 | using System.Diagnostics;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.GP {
|
---|
| 31 | public class ProbabilisticTreeCreator : OperatorBase {
|
---|
[1198] | 32 | private int MAX_TRIES { get { return 100; } }
|
---|
| 33 |
|
---|
[645] | 34 | public override string Description {
|
---|
| 35 | get { return @"Generates a new random operator tree."; }
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | public ProbabilisticTreeCreator()
|
---|
| 39 | : base() {
|
---|
| 40 | AddVariableInfo(new VariableInfo("Random", "Uniform random number generator", typeof(MersenneTwister), VariableKind.In));
|
---|
| 41 | AddVariableInfo(new VariableInfo("OperatorLibrary", "The operator library containing all available operators", typeof(GPOperatorLibrary), VariableKind.In));
|
---|
| 42 | AddVariableInfo(new VariableInfo("MinTreeSize", "The minimal allowed size of the tree", typeof(IntData), VariableKind.In));
|
---|
| 43 | AddVariableInfo(new VariableInfo("MaxTreeSize", "The maximal allowed size of the tree", typeof(IntData), VariableKind.In));
|
---|
| 44 | AddVariableInfo(new VariableInfo("MaxTreeHeight", "The maximal allowed height of the tree", typeof(IntData), VariableKind.In));
|
---|
| 45 | AddVariableInfo(new VariableInfo("FunctionTree", "The created tree", typeof(IFunctionTree), VariableKind.New | VariableKind.Out));
|
---|
| 46 | AddVariableInfo(new VariableInfo("TreeSize", "The size (number of nodes) of the tree", typeof(IntData), VariableKind.New | VariableKind.Out));
|
---|
| 47 | AddVariableInfo(new VariableInfo("TreeHeight", "The height of the tree", typeof(IntData), VariableKind.New | VariableKind.Out));
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | public override IOperation Apply(IScope scope) {
|
---|
| 51 | IRandom random = GetVariableValue<IRandom>("Random", scope, true);
|
---|
| 52 | GPOperatorLibrary opLibrary = GetVariableValue<GPOperatorLibrary>("OperatorLibrary", scope, true);
|
---|
| 53 | int minTreeSize = GetVariableValue<IntData>("MinTreeSize", scope, true).Data;
|
---|
| 54 | int maxTreeSize = GetVariableValue<IntData>("MaxTreeSize", scope, true).Data;
|
---|
| 55 | int maxTreeHeight = GetVariableValue<IntData>("MaxTreeHeight", scope, true).Data;
|
---|
| 56 |
|
---|
| 57 | TreeGardener gardener = new TreeGardener(random, opLibrary);
|
---|
| 58 |
|
---|
| 59 | int treeSize = random.Next(minTreeSize, maxTreeSize + 1);
|
---|
| 60 |
|
---|
[1198] | 61 | IFunctionTree root;
|
---|
| 62 | int actualTreeSize;
|
---|
| 63 | int actualTreeHeight;
|
---|
| 64 | int tries = 0;
|
---|
| 65 | do {
|
---|
| 66 | root = gardener.PTC2(random, treeSize, maxTreeHeight);
|
---|
| 67 | actualTreeSize = root.Size;
|
---|
| 68 | actualTreeHeight = root.Height;
|
---|
| 69 | if (tries++ >= MAX_TRIES) {
|
---|
| 70 | // try a different size
|
---|
| 71 | treeSize = random.Next(minTreeSize, maxTreeSize + 1);
|
---|
| 72 | tries = 0;
|
---|
| 73 | }
|
---|
| 74 | } while (actualTreeSize > maxTreeSize || actualTreeHeight > maxTreeHeight);
|
---|
[645] | 75 |
|
---|
| 76 | scope.AddVariable(new HeuristicLab.Core.Variable(scope.TranslateName("FunctionTree"), root));
|
---|
| 77 | scope.AddVariable(new HeuristicLab.Core.Variable(scope.TranslateName("TreeSize"), new IntData(actualTreeSize)));
|
---|
| 78 | scope.AddVariable(new HeuristicLab.Core.Variable(scope.TranslateName("TreeHeight"), new IntData(actualTreeHeight)));
|
---|
| 79 |
|
---|
| 80 | return gardener.CreateInitializationOperation(gardener.GetAllSubTrees(root), scope);
|
---|
| 81 | }
|
---|
| 82 | }
|
---|
| 83 | } |
---|