source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding-3.4/ProbabilisticTreeCreaterTest.cs @ 12012

Last change on this file since 12012 was 12012, checked in by ascheibe, 5 years ago

#2212 merged r12008, r12009, r12010 back into trunk

File size: 4.8 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.Diagnostics;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.Random;
27using Microsoft.VisualStudio.TestTools.UnitTesting;
28
29namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Tests {
30  [TestClass]
31  public class ProbabilisticTreeCreaterTest {
32    private const int POPULATION_SIZE = 10000;
33    private const int MAX_TREE_LENGTH = 100;
34    private const int MAX_TREE_DEPTH = 10;
35
36    [TestMethod()]
37    [TestCategory("Encodings.SymbolicExpressionTree")]
38    [TestProperty("Time", "long")]
39    public void ProbabilisticTreeCreaterDistributionsTest() {
40      var randomTrees = new List<ISymbolicExpressionTree>();
41      var grammar = Grammars.CreateSimpleArithmeticGrammar();
42      var random = new MersenneTwister(31415);
43      var stopwatch = new Stopwatch();
44      stopwatch.Start();
45      for (int i = 0; i < POPULATION_SIZE; i++) {
46        randomTrees.Add(ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH));
47      }
48      stopwatch.Stop();
49
50      int count = 0;
51      int depth = 0;
52      foreach (var tree in randomTrees) {
53        Util.IsValid(tree);
54        count += tree.Length;
55        depth += tree.Depth;
56      }
57      double msPerRandomTreeCreation = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE;
58
59      Console.WriteLine("ProbabilisticTreeCreator: " + Environment.NewLine +
60        msPerRandomTreeCreation + " ms per random tree (~" + Math.Round(1000.0 / (msPerRandomTreeCreation)) + "random trees / s)" + Environment.NewLine +
61        Util.GetSizeDistributionString(randomTrees, 105, 5) + Environment.NewLine +
62        Util.GetFunctionDistributionString(randomTrees) + Environment.NewLine +
63        Util.GetNumberOfSubtreesDistributionString(randomTrees) + Environment.NewLine +
64        Util.GetTerminalDistributionString(randomTrees) + Environment.NewLine +
65        "Average tree depth: " + depth / POPULATION_SIZE + Environment.NewLine +
66        "Average tree length: " + count / POPULATION_SIZE + Environment.NewLine +
67        "Total nodes created: " + count + Environment.NewLine
68        );
69      //mkommend: commented due to performance issues on the builder
70      // Assert.IsTrue(Math.Round(1000.0 / (msPerRandomTreeCreation)) > 250); // must achieve more than 250 random trees / s
71    }
72
73    [TestMethod]
74    [TestCategory("Encodings.SymbolicExpressionTree")]
75    [TestProperty("Time", "short")]
76    public void ProbabilisticTreeCreatorSpecificTreeSizesTest() {
77      var trees = new List<ISymbolicExpressionTree>();
78      var grammar = Grammars.CreateSimpleArithmeticGrammar();
79      var random = new MersenneTwister(31415);
80      var treeGrammarType = SymbolicExpressionTreeGrammar_Accessor.ShadowedType.ReferencedType;
81
82
83      for (int targetTreeSize = 1; targetTreeSize <= 100; targetTreeSize++) {
84        var tree = new SymbolicExpressionTree();
85        var rootNode = (SymbolicExpressionTreeTopLevelNode)grammar.ProgramRootSymbol.CreateTreeNode();
86        rootNode.SetGrammar((ISymbolicExpressionTreeGrammar)Activator.CreateInstance(treeGrammarType, grammar));
87        if (rootNode.HasLocalParameters) rootNode.ResetLocalParameters(random);
88        var startNode = (SymbolicExpressionTreeTopLevelNode)grammar.StartSymbol.CreateTreeNode();
89        startNode.SetGrammar((ISymbolicExpressionTreeGrammar)Activator.CreateInstance(treeGrammarType, grammar));
90        if (startNode.HasLocalParameters) startNode.ResetLocalParameters(random);
91        rootNode.AddSubtree(startNode);
92
93        ProbabilisticTreeCreator_Accessor.TryCreateFullTreeFromSeed(random, startNode, targetTreeSize, ((int)Math.Log(targetTreeSize, 2)) + 1);
94        tree.Root = rootNode;
95        //mkommend: commented due to performance issues on the builder
96        // Assert.AreEqual(targetTreeSize + 2, tree.Length);  //the root and start node must be additionally added
97      }
98    }
99  }
100}
Note: See TracBrowser for help on using the repository browser.