[3742] | 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 HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
[3062] | 23 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
[3376] | 24 | using HeuristicLab.Common;
|
---|
[3062] | 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Encodings.BinaryVectorEncoding_33.Tests {
|
---|
| 30 |
|
---|
| 31 |
|
---|
| 32 | /// <summary>
|
---|
| 33 | ///This is a test class for SinglePointCrossoverTest and is intended
|
---|
| 34 | ///to contain all SinglePointCrossoverTest Unit Tests
|
---|
| 35 | ///</summary>
|
---|
| 36 | [TestClass()]
|
---|
| 37 | public class UniformCrossoverTest {
|
---|
| 38 |
|
---|
| 39 |
|
---|
| 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 | #region Additional test attributes
|
---|
| 56 | //
|
---|
| 57 | //You can use the following additional attributes as you write your tests:
|
---|
| 58 | //
|
---|
| 59 | //Use ClassInitialize to run code before running the first test in the class
|
---|
| 60 | //[ClassInitialize()]
|
---|
| 61 | //public static void MyClassInitialize(TestContext testContext)
|
---|
| 62 | //{
|
---|
| 63 | //}
|
---|
| 64 | //
|
---|
| 65 | //Use ClassCleanup to run code after all tests in a class have run
|
---|
| 66 | //[ClassCleanup()]
|
---|
| 67 | //public static void MyClassCleanup()
|
---|
| 68 | //{
|
---|
| 69 | //}
|
---|
| 70 | //
|
---|
| 71 | //Use TestInitialize to run code before running each test
|
---|
| 72 | //[TestInitialize()]
|
---|
| 73 | //public void MyTestInitialize()
|
---|
| 74 | //{
|
---|
| 75 | //}
|
---|
| 76 | //
|
---|
| 77 | //Use TestCleanup to run code after each test has run
|
---|
| 78 | //[TestCleanup()]
|
---|
| 79 | //public void MyTestCleanup()
|
---|
| 80 | //{
|
---|
| 81 | //}
|
---|
| 82 | //
|
---|
| 83 | #endregion
|
---|
| 84 |
|
---|
| 85 | /// <summary>
|
---|
| 86 | ///A test for Cross
|
---|
| 87 | ///</summary>
|
---|
| 88 | [TestMethod()]
|
---|
| 89 | [DeploymentItem("HeuristicLab.Encodings.BinaryVectorEncoding-3.3.dll")]
|
---|
| 90 | public void SinglePointCrossoverCrossTest() {
|
---|
| 91 | UniformCrossover_Accessor target = new UniformCrossover_Accessor(new PrivateObject(typeof(UniformCrossover)));
|
---|
| 92 | ItemArray<BinaryVector> parents;
|
---|
| 93 | TestRandom random = new TestRandom();
|
---|
| 94 | bool exceptionFired;
|
---|
| 95 | // The following test checks if there is an exception when there are more than 2 parents
|
---|
| 96 | random.Reset();
|
---|
| 97 | parents = new ItemArray<BinaryVector>(new BinaryVector[] { new BinaryVector(5), new BinaryVector(6), new BinaryVector(4) });
|
---|
| 98 | exceptionFired = false;
|
---|
| 99 | try {
|
---|
| 100 | BinaryVector actual;
|
---|
| 101 | actual = target.Cross(random, parents);
|
---|
| 102 | }
|
---|
| 103 | catch (System.ArgumentException) {
|
---|
| 104 | exceptionFired = true;
|
---|
| 105 | }
|
---|
| 106 | Assert.IsTrue(exceptionFired);
|
---|
| 107 | // The following test checks if there is an exception when there are less than 2 parents
|
---|
| 108 | random.Reset();
|
---|
| 109 | parents = new ItemArray<BinaryVector>(new BinaryVector[] { new BinaryVector(4) });
|
---|
| 110 | exceptionFired = false;
|
---|
| 111 | try {
|
---|
| 112 | BinaryVector actual;
|
---|
| 113 | actual = target.Cross(random, parents);
|
---|
| 114 | } catch (System.ArgumentException) {
|
---|
| 115 | exceptionFired = true;
|
---|
| 116 | }
|
---|
| 117 | Assert.IsTrue(exceptionFired);
|
---|
| 118 | }
|
---|
| 119 |
|
---|
| 120 | /// <summary>
|
---|
| 121 | ///A test for Apply
|
---|
| 122 | ///</summary>
|
---|
| 123 | [TestMethod()]
|
---|
| 124 | public void SinglePointCrossoverApplyTest() {
|
---|
| 125 | TestRandom random = new TestRandom();
|
---|
| 126 | BinaryVector parent1, parent2, expected, actual;
|
---|
| 127 | bool exceptionFired;
|
---|
| 128 | // The following test is based on Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg, p. 49
|
---|
| 129 | random.Reset();
|
---|
| 130 | random.DoubleNumbers = new double[] { 0.35, 0.62, 0.18, 0.42, 0.83, 0.76, 0.39, 0.51, 0.36 };
|
---|
| 131 | parent1 = new BinaryVector(new bool[] { false, false, false, false, true, false, false, false, false });
|
---|
| 132 | parent2 = new BinaryVector(new bool[] { true, true, false, true, false, false, false, false, true });
|
---|
| 133 | expected = new BinaryVector(new bool[] { false, true, false, false, false, false, false, false, false});
|
---|
| 134 | actual = UniformCrossover.Apply(random, parent1, parent2);
|
---|
| 135 | Assert.IsTrue(Auxiliary.BinaryVectorIsEqualByPosition(actual, expected));
|
---|
| 136 |
|
---|
| 137 | // The following test is based on Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg, p. 49
|
---|
| 138 | random.Reset();
|
---|
| 139 | random.DoubleNumbers = new double[] { 0.35, 0.62, 0.18, 0.42, 0.83, 0.76, 0.39, 0.51, 0.36 };
|
---|
| 140 | parent2 = new BinaryVector(new bool[] { false, false, false, false, true, false, false, false, false });
|
---|
| 141 | parent1 = new BinaryVector(new bool[] { true, true, false, true, false, false, false, false, true });
|
---|
| 142 | expected = new BinaryVector(new bool[] { true, false, false, true, true, false, false, false, true });
|
---|
| 143 | actual = UniformCrossover.Apply(random, parent1, parent2);
|
---|
| 144 | Assert.IsTrue(Auxiliary.BinaryVectorIsEqualByPosition(actual, expected));
|
---|
| 145 |
|
---|
| 146 | // The following test is not based on any published examples
|
---|
| 147 | random.Reset();
|
---|
| 148 | random.DoubleNumbers = new double[] { 0.35, 0.62, 0.18, 0.42, 0.83, 0.76, 0.39, 0.51, 0.36 };
|
---|
| 149 | parent1 = new BinaryVector(new bool[] { false, true, true, false, false }); // this parent is longer
|
---|
| 150 | parent2 = new BinaryVector(new bool[] { false, true, true, false });
|
---|
| 151 | exceptionFired = false;
|
---|
| 152 | try {
|
---|
| 153 | actual = UniformCrossover.Apply(random, parent1, parent2);
|
---|
| 154 | } catch (System.ArgumentException) {
|
---|
| 155 | exceptionFired = true;
|
---|
| 156 | }
|
---|
| 157 | Assert.IsTrue(exceptionFired);
|
---|
| 158 | }
|
---|
| 159 |
|
---|
| 160 | /// <summary>
|
---|
| 161 | ///A test for SinglePointCrossover Constructor
|
---|
| 162 | ///</summary>
|
---|
| 163 | [TestMethod()]
|
---|
| 164 | public void SinglePointCrossoverConstructorTest() {
|
---|
| 165 | NPointCrossover target = new NPointCrossover();
|
---|
| 166 | }
|
---|
| 167 | }
|
---|
| 168 | }
|
---|