source: stable/HeuristicLab.Tests/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding-3.4/SubtreeCrossoverTest.cs @ 15584

Last change on this file since 15584 was 15584, checked in by swagner, 17 months ago

#2640: Updated year of copyrights in license headers on stable

File size: 3.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2018 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.Random;
26using Microsoft.VisualStudio.TestTools.UnitTesting;
27
28namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Tests {
29  [TestClass]
30  public class SubtreeCrossoverTest {
31    private const int POPULATION_SIZE = 1000;
32
33    [TestMethod]
34    [TestCategory("Encodings.SymbolicExpressionTree")]
35    [TestProperty("Time", "long")]
36    public void SubtreeCrossoverDistributionsTest() {
37      int generations = 5;
38      var trees = new List<ISymbolicExpressionTree>();
39      var grammar = Grammars.CreateArithmeticAndAdfGrammar();
40      var random = new MersenneTwister(31415);
41      double msPerCrossoverEvent;
42
43      for (int i = 0; i < POPULATION_SIZE; i++) {
44        trees.Add(ProbabilisticTreeCreator.Create(random, grammar, 100, 10));
45        for (int j = random.Next(3); j < 3; j++)
46          SubroutineCreater.CreateSubroutine(random, trees[i], 100, 10, 3, 3);
47      }
48      Stopwatch stopwatch = new Stopwatch();
49      stopwatch.Start();
50      for (int gCount = 0; gCount < generations; gCount++) {
51        for (int i = 0; i < POPULATION_SIZE; i++) {
52          var par0 = (ISymbolicExpressionTree)trees.SampleRandom(random).Clone();
53          var par1 = (ISymbolicExpressionTree)trees.SampleRandom(random).Clone();
54          SubtreeCrossover.Cross(random, par0, par1, 0.9, 100, 10);
55        }
56      }
57      stopwatch.Stop();
58      foreach (var tree in trees)
59        Util.IsValid(tree);
60
61      msPerCrossoverEvent = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE / (double)generations;
62
63      Console.WriteLine("SubtreeCrossover: " + Environment.NewLine +
64        msPerCrossoverEvent + " ms per crossover event (~" + Math.Round(1000.0 / (msPerCrossoverEvent)) + "crossovers / s)" + Environment.NewLine +
65        Util.GetSizeDistributionString(trees, 105, 5) + Environment.NewLine +
66        Util.GetFunctionDistributionString(trees) + Environment.NewLine +
67        Util.GetNumberOfSubtreesDistributionString(trees) + Environment.NewLine +
68        Util.GetTerminalDistributionString(trees) + Environment.NewLine
69        );
70
71      //mkommend: commented due to performance issues on the builder
72      //Assert.IsTrue(Math.Round(1000.0 / (msPerCrossoverEvent)) > 2000); // must achieve more than 2000 x-overs/s
73    }
74  }
75}
Note: See TracBrowser for help on using the repository browser.