Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PausableBasicAlgorithm/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Crossovers/SymbolicDataAnalysisExpressionDepthConstrainedCrossover.cs @ 14586

Last change on this file since 14586 was 12422, checked in by mkommend, 9 years ago

#2320: Merged the encoding class and all accompanying changes in the trunk.

File size: 7.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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 System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Common;
26using HeuristicLab.Core;
27using HeuristicLab.Data;
28using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
29using HeuristicLab.Parameters;
30using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
31using HeuristicLab.Random;
32
33namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
34  [Item("DepthConstrainedCrossover", "An operator which performs subtree swapping within a specific depth range. The range parameter controls the crossover behavior:\n" +
35                                     "- HighLevel (upper 25% of the tree)\n" +
36                                     "- Standard (mid 50% of the tree)\n" +
37                                     "- LowLevel (lower 25% of the tree)")]
38  public sealed class SymbolicDataAnalysisExpressionDepthConstrainedCrossover<T> :
39    SymbolicDataAnalysisExpressionCrossover<T> where T : class, IDataAnalysisProblemData {
40    private enum Ranges { HighLevel, Standard, LowLevel };
41    private const string DepthRangeParameterName = "DepthRange";
42
43    #region Parameter properties
44    public IConstrainedValueParameter<StringValue> DepthRangeParameter {
45      get { return (IConstrainedValueParameter<StringValue>)Parameters[DepthRangeParameterName]; }
46    }
47    #endregion
48
49    #region Properties
50    public StringValue DepthRange {
51      get { return (StringValue)DepthRangeParameter.ActualValue; }
52    }
53    #endregion
54
55    [StorableConstructor]
56    private SymbolicDataAnalysisExpressionDepthConstrainedCrossover(bool deserializing) : base(deserializing) { }
57    private SymbolicDataAnalysisExpressionDepthConstrainedCrossover(SymbolicDataAnalysisExpressionCrossover<T> original, Cloner cloner)
58      : base(original, cloner) { }
59    public SymbolicDataAnalysisExpressionDepthConstrainedCrossover()
60      : base() {
61      Parameters.Add(new ConstrainedValueParameter<StringValue>(DepthRangeParameterName, "Depth range specifier"));
62      DepthRangeParameter.ValidValues.Add(new StringValue(Enum.GetName(typeof(Ranges), Ranges.HighLevel)).AsReadOnly());
63      DepthRangeParameter.ValidValues.Add(new StringValue(Enum.GetName(typeof(Ranges), Ranges.Standard)).AsReadOnly());
64      DepthRangeParameter.ValidValues.Add(new StringValue(Enum.GetName(typeof(Ranges), Ranges.LowLevel)).AsReadOnly());
65      name = "DepthConstrainedCrossover";
66    }
67    public override IDeepCloneable Clone(Cloner cloner) { return new SymbolicDataAnalysisExpressionDepthConstrainedCrossover<T>(this, cloner); }
68
69    public override ISymbolicExpressionTree Crossover(IRandom random, ISymbolicExpressionTree parent0, ISymbolicExpressionTree parent1) {
70      return Cross(random, parent0, parent1, MaximumSymbolicExpressionTreeDepth.Value, MaximumSymbolicExpressionTreeLength.Value, DepthRange.Value);
71    }
72
73
74    /// <summary>
75    /// Takes two parent individuals P0 and P1.
76    /// Randomly choose nodes that fall within the specified depth range in both parents.
77    /// </summary>
78    /// <param name="random">Pseudo-random number generator.</param>
79    /// <param name="parent0">First parent.</param>
80    /// <param name="parent1">Second parent.</param>
81    /// <param name="maxDepth">Maximum allowed length depth.</param>
82    /// <param name="maxLength">Maximum allowed tree length.</param>
83    /// <param name="mode">Controls the crossover behavior:
84    /// - HighLevel (upper 25% of the tree),
85    /// - Standard (mid 50%)
86    /// - LowLevel (low 25%)</param>
87    /// <returns></returns>
88    public static ISymbolicExpressionTree Cross(IRandom random, ISymbolicExpressionTree parent0, ISymbolicExpressionTree parent1, int maxDepth, int maxLength, string mode) {
89      int depth = parent0.Root.GetDepth() - 1; // substract 1 because the tree levels are counted from 0
90      var depthRange = new IntRange();
91      const int depthOffset = 2; // skip the first 2 levels (root + startNode)
92      switch ((Ranges)Enum.Parse(typeof(Ranges), mode)) {
93        case Ranges.HighLevel:
94          depthRange.Start = depthOffset; // skip the first 2 levels (root + startNode)
95          depthRange.End = depthRange.Start + (int)Math.Round(depth * 0.25);
96          break;
97        case Ranges.Standard:
98          depthRange.Start = depthOffset + (int)Math.Round(depth * 0.25);
99          depthRange.End = depthRange.Start + (int)Math.Round(depth * 0.5);
100          break;
101        case Ranges.LowLevel:
102          depthRange.Start = depthOffset + (int)Math.Round(depth * 0.75);
103          depthRange.End = Math.Max(depthRange.Start, depth);
104          break;
105      }
106
107      // make sure that the depth range does not exceeded the actual depth of parent0
108      if (depthRange.Start > depth)
109        depthRange.Start = depth;
110      if (depthRange.End < depthRange.Start)
111        depthRange.End = depthRange.Start;
112
113      var crossoverPoints0 = (from node in GetNodesAtDepth(parent0, depthRange) select new CutPoint(node.Parent, node)).ToList();
114
115      if (crossoverPoints0.Count == 0)
116        throw new Exception("No crossover points available in the first parent");
117
118      var crossoverPoint0 = crossoverPoints0.SampleRandom(random);
119      int level = parent0.Root.GetBranchLevel(crossoverPoint0.Child);
120      int length = parent0.Root.GetLength() - crossoverPoint0.Child.GetLength();
121
122      var allowedBranches = (from s in GetNodesAtDepth(parent1, depthRange)
123                             where s.GetDepth() + level <= maxDepth
124                             where s.GetLength() + length <= maxLength
125                             where crossoverPoint0.IsMatchingPointType(s)
126                             select s).ToList();
127      if (allowedBranches.Count == 0) return parent0;
128
129      var selectedBranch = allowedBranches.SampleRandom(random);
130      Swap(crossoverPoint0, selectedBranch);
131      return parent0;
132    }
133
134    private static IEnumerable<ISymbolicExpressionTreeNode> GetNodesAtDepth(ISymbolicExpressionTree tree, IntRange depthRange) {
135      var treeDepth = tree.Root.GetDepth();
136      return from node in tree.Root.IterateNodesPostfix()
137             let depth = treeDepth - node.GetDepth()
138             where depthRange.Start <= depth
139             where depth <= depthRange.End
140             select node;
141    }
142  }
143}
Note: See TracBrowser for help on using the repository browser.