Free cookie consent management tool by TermsFeed Policy Generator

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

Last change on this file since 5658 was 5445, checked in by swagner, 14 years ago

Updated year of copyrights (#1406)

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