Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding-3.4/SubtreeCrossoverTest.cs @ 9322

Last change on this file since 9322 was 9322, checked in by mkommend, 11 years ago

#1890: Deactived performance related asserts in unit tests, due to build server problems.

File size: 3.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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_34.Tests {
30  [TestClass]
31  public class SubtreeCrossoverTest {
32    private const int POPULATION_SIZE = 1000;
33    private TestContext testContextInstance;
34
35    /// <summary>
36    ///Gets or sets the test context which provides
37    ///information about and functionality for the current test run.
38    ///</summary>
39    public TestContext TestContext {
40      get {
41        return testContextInstance;
42      }
43      set {
44        testContextInstance = value;
45      }
46    }
47
48    [TestMethod()]
49    public void SubtreeCrossoverDistributionsTest() {
50      int generations = 5;
51      var trees = new List<ISymbolicExpressionTree>();
52      var grammar = Grammars.CreateArithmeticAndAdfGrammar();
53      var random = new MersenneTwister(31415);
54      double msPerCrossoverEvent;
55
56      for (int i = 0; i < POPULATION_SIZE; i++) {
57        trees.Add(ProbabilisticTreeCreator.Create(random, grammar, 100, 10));
58        for (int j = random.Next(3); j < 3; j++)
59          SubroutineCreater.CreateSubroutine(random, trees[i], 100, 10, 3, 3);
60      }
61      Stopwatch stopwatch = new Stopwatch();
62      stopwatch.Start();
63      for (int gCount = 0; gCount < generations; gCount++) {
64        for (int i = 0; i < POPULATION_SIZE; i++) {
65          var par0 = (ISymbolicExpressionTree)trees.SelectRandom(random).Clone();
66          var par1 = (ISymbolicExpressionTree)trees.SelectRandom(random).Clone();
67          SubtreeCrossover.Cross(random, par0, par1, 0.9, 100, 10);
68        }
69      }
70      stopwatch.Stop();
71      foreach (var tree in trees)
72        Util.IsValid(tree);
73
74      msPerCrossoverEvent = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE / (double)generations;
75
76      Console.WriteLine("SubtreeCrossover: " + Environment.NewLine +
77        msPerCrossoverEvent + " ms per crossover event (~" + Math.Round(1000.0 / (msPerCrossoverEvent)) + "crossovers / s)" + Environment.NewLine +
78        Util.GetSizeDistributionString(trees, 105, 5) + Environment.NewLine +
79        Util.GetFunctionDistributionString(trees) + Environment.NewLine +
80        Util.GetNumberOfSubtreesDistributionString(trees) + Environment.NewLine +
81        Util.GetTerminalDistributionString(trees) + Environment.NewLine
82        );
83
84      //mkommend: commented due to performance issues on the builder
85      //Assert.IsTrue(Math.Round(1000.0 / (msPerCrossoverEvent)) > 2000); // must achieve more than 2000 x-overs/s
86    }
87  }
88}
Note: See TracBrowser for help on using the repository browser.