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