Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.3/Tests/AllArchitectureAlteringOperatorsTest.cs @ 3462

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

Refactored symbolic expression tree encoding and problem classes for symbolic regression. #937 , #938

File size: 4.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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.Text;
24using System.Collections.Generic;
25using System.Linq;
26using Microsoft.VisualStudio.TestTools.UnitTesting;
27using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
28using HeuristicLab.Random;
29using System.Diagnostics;
30using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.ArchitectureAlteringOperators;
31using HeuristicLab.Data;
32using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Creators;
33using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Crossovers;
34
35namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding_3._3.Tests {
36  [TestClass]
37  public class AllArchitectureAlteringOperatorsTest {
38    private const int POPULATION_SIZE = 1000;
39    private const int N_ITERATIONS = 20;
40    private const int MAX_TREE_SIZE = 100;
41    private const int MAX_TREE_HEIGHT = 10;
42    private TestContext testContextInstance;
43
44    /// <summary>
45    ///Gets or sets the test context which provides
46    ///information about and functionality for the current test run.
47    ///</summary>
48    public TestContext TestContext {
49      get {
50        return testContextInstance;
51      }
52      set {
53        testContextInstance = value;
54      }
55    }
56
57    [TestMethod()]
58    public void AllArchitectureAlteringOperatorsDistributionTest() {
59      var trees = new List<SymbolicExpressionTree>();
60      var newTrees = new List<SymbolicExpressionTree>();
61      var grammar = Grammars.CreateArithmeticAndAdfGrammar();
62      var random = new MersenneTwister(31415);
63      int failedEvents = 0;
64      IntValue maxTreeSize = new IntValue(100);
65      IntValue maxTreeHeigth = new IntValue(10);
66      IntValue maxDefuns = new IntValue(3);
67      IntValue maxArgs = new IntValue(3);
68      for (int i = 0; i < POPULATION_SIZE; i++) {
69        var tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_SIZE, MAX_TREE_HEIGHT, 3, 3);
70        Util.IsValid(tree);
71        trees.Add(tree);
72      }
73      Stopwatch stopwatch = new Stopwatch();
74      stopwatch.Start();
75      var combinedAAOperator = new RandomArchitectureAlteringOperator();
76      for (int g = 0; g < N_ITERATIONS; g++) {
77        for (int i = 0; i < POPULATION_SIZE; i++) {
78          if (random.NextDouble() < 0.5) {
79            // manipulate
80            var selectedTree = (SymbolicExpressionTree)trees.SelectRandom(random).Clone();
81            var op = combinedAAOperator.Operators.SelectRandom(random);
82            bool success;
83            op.ModifyArchitecture(random, selectedTree, grammar, maxTreeSize, maxTreeHeigth, maxDefuns, maxArgs, out success);
84            if (!success) failedEvents++;
85            Util.IsValid(selectedTree);
86            newTrees.Add(selectedTree);
87          } else {
88            // crossover
89            var par0 = (SymbolicExpressionTree)trees.SelectRandom(random).Clone();
90            var par1 = (SymbolicExpressionTree)trees.SelectRandom(random).Clone();
91            bool success;
92            newTrees.Add(SubtreeCrossover.Cross(random, par0, par1, 0.9, 100, 10, out success));
93            if (!success) failedEvents++;
94          }
95        }
96        trees = newTrees;
97      }
98      stopwatch.Stop();
99      var msPerOperation = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE / (double)N_ITERATIONS;
100      Assert.Inconclusive("AllArchitectureAlteringOperators: " + Environment.NewLine +
101        "Failed events: " + failedEvents / (double)POPULATION_SIZE / N_ITERATIONS * 100 + " %" + Environment.NewLine +
102        "Operations / s: ~" + Math.Round(1000.0 / (msPerOperation)) + "operations / s)" + Environment.NewLine +
103        Util.GetSizeDistributionString(trees, 200, 5) + Environment.NewLine +
104        Util.GetFunctionDistributionString(trees) + Environment.NewLine +
105        Util.GetNumberOfSubTreesDistributionString(trees) + Environment.NewLine +
106        Util.GetTerminalDistributionString(trees) + Environment.NewLine
107        );
108    }
109  }
110}
Note: See TracBrowser for help on using the repository browser.