#region License Information
/* HeuristicLab
* Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
using HeuristicLab.PluginInfrastructure;
namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
[NonDiscoverableType]
[StorableClass]
[Item("RampedHalfAndHalfTreeCreator", "An operator that creates new symbolic expression trees in an alternate way: half the trees are created usign the 'Grow' method while the other half are created using the 'Full' method")]
public class RampedHalfAndHalfTreeCreator : TracingSymbolicExpressionTreeCreator,
ISymbolicExpressionTreeSizeConstraintOperator,
ISymbolicExpressionTreeGrammarBasedOperator {
private const string MaximumSymbolicExpressionTreeLengthParameterName = "MaximumSymbolicExpressionTreeLength";
private const string MaximumSymbolicExpressionTreeDepthParameterName = "MaximumSymbolicExpressionTreeDepth";
private const string SymbolicExpressionTreeGrammarParameterName = "SymbolicExpressionTreeGrammar";
private const string ClonedSymbolicExpressionTreeGrammarParameterName = "ClonedSymbolicExpressionTreeGrammar";
#region Parameter Properties
public IValueLookupParameter MaximumSymbolicExpressionTreeLengthParameter {
get { return (IValueLookupParameter)Parameters[MaximumSymbolicExpressionTreeLengthParameterName]; }
}
public IValueLookupParameter MaximumSymbolicExpressionTreeDepthParameter {
get { return (IValueLookupParameter)Parameters[MaximumSymbolicExpressionTreeDepthParameterName]; }
}
public IValueLookupParameter SymbolicExpressionTreeGrammarParameter {
get {
return (IValueLookupParameter)Parameters[SymbolicExpressionTreeGrammarParameterName];
}
}
public ILookupParameter ClonedSymbolicExpressionTreeGrammarParameter {
get {
return (ILookupParameter)Parameters[ClonedSymbolicExpressionTreeGrammarParameterName];
}
}
#endregion
#region Properties
public IntValue MaximumSymbolicExpressionTreeDepth {
get { return MaximumSymbolicExpressionTreeDepthParameter.ActualValue; }
}
public IntValue MaximumSymbolicExpressionTreeLength {
get { return MaximumSymbolicExpressionTreeLengthParameter.ActualValue; }
}
public ISymbolicExpressionGrammar ClonedSymbolicExpressionTreeGrammar {
get { return ClonedSymbolicExpressionTreeGrammarParameter.ActualValue; }
}
#endregion
[StorableConstructor]
protected RampedHalfAndHalfTreeCreator(bool deserializing) : base(deserializing) { }
protected RampedHalfAndHalfTreeCreator(RampedHalfAndHalfTreeCreator original, Cloner cloner) : base(original, cloner) { }
public RampedHalfAndHalfTreeCreator()
: base() {
Parameters.Add(new ValueLookupParameter(MaximumSymbolicExpressionTreeLengthParameterName,
"The maximal length (number of nodes) of the symbolic expression tree (this parameter is ignored)."));
Parameters.Add(new ValueLookupParameter(MaximumSymbolicExpressionTreeDepthParameterName,
"The maximal depth of the symbolic expression tree (a tree with one node has depth = 0)."));
Parameters.Add(new ValueLookupParameter(SymbolicExpressionTreeGrammarParameterName,
"The tree grammar that defines the correct syntax of symbolic expression trees that should be created."));
Parameters.Add(new LookupParameter(ClonedSymbolicExpressionTreeGrammarParameterName,
"An immutable clone of the concrete grammar that is actually used to create and manipulate trees."));
}
public override IDeepCloneable Clone(Cloner cloner) {
return new RampedHalfAndHalfTreeCreator(this, cloner);
}
public override IOperation Apply() {
if (ClonedSymbolicExpressionTreeGrammarParameter.ActualValue == null) {
SymbolicExpressionTreeGrammarParameter.ActualValue.ReadOnly = true;
IScope globalScope = ExecutionContext.Scope;
while (globalScope.Parent != null)
globalScope = globalScope.Parent;
globalScope.Variables.Add(new Variable(ClonedSymbolicExpressionTreeGrammarParameterName,
(ISymbolicExpressionGrammar)SymbolicExpressionTreeGrammarParameter.ActualValue.Clone()));
}
return base.Apply();
}
protected override ISymbolicExpressionTree Create(IRandom random) {
return Create(random, ClonedSymbolicExpressionTreeGrammar, MaximumSymbolicExpressionTreeLength.Value, MaximumSymbolicExpressionTreeDepth.Value);
}
public override ISymbolicExpressionTree CreateTree(IRandom random, ISymbolicExpressionGrammar grammar, int maxTreeLength, int maxTreeDepth) {
return Create(random, grammar, maxTreeLength, maxTreeDepth);
}
///
/// Create a symbolic expression tree using 'RampedHalfAndHalf' strategy.
/// Half the trees are created with the 'Grow' method, and the other half are created with the 'Full' method.
///
/// Random generator
/// Available tree grammar
/// Maximum tree length (this parameter is ignored)
/// Maximum tree depth
///
public static ISymbolicExpressionTree Create(IRandom random, ISymbolicExpressionGrammar grammar, int maxTreeLength, int maxTreeDepth) {
var tree = new SymbolicExpressionTree();
var rootNode = (SymbolicExpressionTreeTopLevelNode)grammar.ProgramRootSymbol.CreateTreeNode();
if (rootNode.HasLocalParameters) rootNode.ResetLocalParameters(random);
rootNode.SetGrammar(new SymbolicExpressionTreeGrammar(grammar));
var startNode = (SymbolicExpressionTreeTopLevelNode)grammar.StartSymbol.CreateTreeNode();
if (startNode.HasLocalParameters) startNode.ResetLocalParameters(random);
startNode.SetGrammar(new SymbolicExpressionTreeGrammar(grammar));
rootNode.AddSubtree(startNode);
double p = random.NextDouble();
if (p < 0.5)
GrowTreeCreator.Create(random, startNode, maxTreeDepth - 2);
else
FullTreeCreator.Create(random, startNode, maxTreeDepth - 2);
tree.Root = rootNode;
return tree;
}
}
}