[3360] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16662] | 3 | * Copyright (C) 2002-2019 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 |
|
---|
| 22 | using System;
|
---|
[3297] | 23 | using System.Collections.Generic;
|
---|
[4068] | 24 | using System.Diagnostics;
|
---|
[3297] | 25 | using HeuristicLab.Random;
|
---|
[4068] | 26 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
[3297] | 27 |
|
---|
[9764] | 28 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Tests {
|
---|
[3297] | 29 | [TestClass]
|
---|
| 30 | public class SubtreeCrossoverTest {
|
---|
[3360] | 31 | private const int POPULATION_SIZE = 1000;
|
---|
[3297] | 32 |
|
---|
[9770] | 33 | [TestMethod]
|
---|
| 34 | [TestCategory("Encodings.SymbolicExpressionTree")]
|
---|
| 35 | [TestProperty("Time", "long")]
|
---|
[3360] | 36 | public void SubtreeCrossoverDistributionsTest() {
|
---|
[3297] | 37 | int generations = 5;
|
---|
[5549] | 38 | var trees = new List<ISymbolicExpressionTree>();
|
---|
[3360] | 39 | var grammar = Grammars.CreateArithmeticAndAdfGrammar();
|
---|
[5367] | 40 | var random = new MersenneTwister(31415);
|
---|
[3360] | 41 | double msPerCrossoverEvent;
|
---|
| 42 |
|
---|
| 43 | for (int i = 0; i < POPULATION_SIZE; i++) {
|
---|
[5686] | 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);
|
---|
[3297] | 47 | }
|
---|
[16386] | 48 | var children = new List<ISymbolicExpressionTree>(trees);
|
---|
| 49 |
|
---|
[3297] | 50 | Stopwatch stopwatch = new Stopwatch();
|
---|
| 51 | stopwatch.Start();
|
---|
| 52 | for (int gCount = 0; gCount < generations; gCount++) {
|
---|
[3360] | 53 | for (int i = 0; i < POPULATION_SIZE; i++) {
|
---|
[12482] | 54 | var par0 = (ISymbolicExpressionTree)trees.SampleRandom(random).Clone();
|
---|
| 55 | var par1 = (ISymbolicExpressionTree)trees.SampleRandom(random).Clone();
|
---|
[16386] | 56 | children[i] = SubtreeCrossover.Cross(random, par0, par1, 0.9, 100, 10);
|
---|
[3297] | 57 | }
|
---|
[16386] | 58 | trees = children;
|
---|
[3297] | 59 | }
|
---|
| 60 | stopwatch.Stop();
|
---|
[3360] | 61 | foreach (var tree in trees)
|
---|
| 62 | Util.IsValid(tree);
|
---|
[3297] | 63 |
|
---|
[3360] | 64 | msPerCrossoverEvent = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE / (double)generations;
|
---|
[3297] | 65 |
|
---|
[5367] | 66 | Console.WriteLine("SubtreeCrossover: " + Environment.NewLine +
|
---|
[3360] | 67 | msPerCrossoverEvent + " ms per crossover event (~" + Math.Round(1000.0 / (msPerCrossoverEvent)) + "crossovers / s)" + Environment.NewLine +
|
---|
| 68 | Util.GetSizeDistributionString(trees, 105, 5) + Environment.NewLine +
|
---|
| 69 | Util.GetFunctionDistributionString(trees) + Environment.NewLine +
|
---|
[5733] | 70 | Util.GetNumberOfSubtreesDistributionString(trees) + Environment.NewLine +
|
---|
[3360] | 71 | Util.GetTerminalDistributionString(trees) + Environment.NewLine
|
---|
| 72 | );
|
---|
[5411] | 73 |
|
---|
[9322] | 74 | //mkommend: commented due to performance issues on the builder
|
---|
| 75 | //Assert.IsTrue(Math.Round(1000.0 / (msPerCrossoverEvent)) > 2000); // must achieve more than 2000 x-overs/s
|
---|
[3297] | 76 | }
|
---|
| 77 | }
|
---|
| 78 | }
|
---|