[3360] | 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Text;
|
---|
| 24 | using System.Collections.Generic;
|
---|
| 25 | using System.Linq;
|
---|
| 26 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
| 27 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
| 28 | using HeuristicLab.Random;
|
---|
| 29 | using System.Diagnostics;
|
---|
| 30 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.ArchitectureAlteringOperators;
|
---|
| 31 | using HeuristicLab.Data;
|
---|
| 32 |
|
---|
| 33 | namespace 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);
|
---|
| 61 | int failedEvents = 0;
|
---|
| 62 | IntValue maxTreeSize = new IntValue(100);
|
---|
| 63 | IntValue maxTreeHeigth = new IntValue(10);
|
---|
| 64 | IntValue maxDefuns = new IntValue(3);
|
---|
| 65 | IntValue maxArgs = new IntValue(3);
|
---|
| 66 | for (int i = 0; i < POPULATION_SIZE; i++) {
|
---|
| 67 | var tree = ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_SIZE, MAX_TREE_HEIGHT, 3, 3);
|
---|
| 68 | Util.IsValid(tree);
|
---|
| 69 | trees.Add(tree);
|
---|
| 70 | }
|
---|
| 71 | Stopwatch stopwatch = new Stopwatch();
|
---|
| 72 | stopwatch.Start();
|
---|
| 73 | var combinedAAOperator = new RandomArchitectureAlteringOperator();
|
---|
| 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);
|
---|
| 80 | bool success;
|
---|
| 81 | op.ModifyArchitecture(random, selectedTree, grammar, maxTreeSize, maxTreeHeigth, maxDefuns, maxArgs, out success);
|
---|
| 82 | if (!success) failedEvents++;
|
---|
| 83 | Util.IsValid(selectedTree);
|
---|
| 84 | newTrees.Add(selectedTree);
|
---|
| 85 | } else {
|
---|
| 86 | // crossover
|
---|
| 87 | var par0 = (SymbolicExpressionTree)trees.SelectRandom(random).Clone();
|
---|
| 88 | var par1 = (SymbolicExpressionTree)trees.SelectRandom(random).Clone();
|
---|
| 89 | bool success;
|
---|
| 90 | newTrees.Add(SubtreeCrossover.Cross(random, par0, par1, 0.9, 100, 10, out success));
|
---|
| 91 | if (!success) failedEvents++;
|
---|
| 92 | }
|
---|
[3360] | 93 | }
|
---|
| 94 | trees = newTrees;
|
---|
| 95 | }
|
---|
| 96 | stopwatch.Stop();
|
---|
| 97 | var msPerOperation = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE / (double)N_ITERATIONS;
|
---|
| 98 | Assert.Inconclusive("AllArchitectureAlteringOperators: " + Environment.NewLine +
|
---|
| 99 | "Failed events: " + failedEvents / (double)POPULATION_SIZE / N_ITERATIONS * 100 + " %" + Environment.NewLine +
|
---|
| 100 | "Operations / s: ~" + Math.Round(1000.0 / (msPerOperation)) + "operations / s)" + Environment.NewLine +
|
---|
| 101 | Util.GetSizeDistributionString(trees, 200, 5) + Environment.NewLine +
|
---|
| 102 | Util.GetFunctionDistributionString(trees) + Environment.NewLine +
|
---|
| 103 | Util.GetNumberOfSubTreesDistributionString(trees) + Environment.NewLine +
|
---|
| 104 | Util.GetTerminalDistributionString(trees) + Environment.NewLine
|
---|
| 105 | );
|
---|
| 106 | }
|
---|
| 107 | }
|
---|
| 108 | }
|
---|