[3742] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12009] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3742] | 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 |
|
---|
[4068] | 22 | using HeuristicLab.Core;
|
---|
[6891] | 23 | using HeuristicLab.Tests;
|
---|
[3032] | 24 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
| 25 |
|
---|
[9885] | 26 | namespace HeuristicLab.Encodings.IntegerVectorEncoding.Tests {
|
---|
[3032] | 27 | /// <summary>
|
---|
| 28 | ///This is a test class for SinglePointCrossoverTest and is intended
|
---|
| 29 | ///to contain all SinglePointCrossoverTest Unit Tests
|
---|
| 30 | ///</summary>
|
---|
| 31 | [TestClass()]
|
---|
| 32 | public class SinglePointCrossoverTest {
|
---|
| 33 | /// <summary>
|
---|
| 34 | ///A test for Cross
|
---|
| 35 | ///</summary>
|
---|
[9885] | 36 | [TestMethod]
|
---|
| 37 | [TestCategory("Encodings.IntegerVector")]
|
---|
| 38 | [TestProperty("Time", "short")]
|
---|
[3032] | 39 | public void SinglePointCrossoverCrossTest() {
|
---|
[13246] | 40 | var target = new PrivateObject(typeof(SinglePointCrossover));
|
---|
[3059] | 41 | ItemArray<IntegerVector> parents;
|
---|
[3032] | 42 | TestRandom random = new TestRandom();
|
---|
| 43 | bool exceptionFired;
|
---|
| 44 | // The following test checks if there is an exception when there are more than 2 parents
|
---|
| 45 | random.Reset();
|
---|
[3059] | 46 | parents = new ItemArray<IntegerVector>(new IntegerVector[] { new IntegerVector(5), new IntegerVector(6), new IntegerVector(4) });
|
---|
[3032] | 47 | exceptionFired = false;
|
---|
| 48 | try {
|
---|
[3059] | 49 | IntegerVector actual;
|
---|
[13246] | 50 | actual = (IntegerVector)target.Invoke("Cross", random, parents);
|
---|
| 51 | }
|
---|
| 52 | catch (System.ArgumentException) {
|
---|
[3032] | 53 | exceptionFired = true;
|
---|
| 54 | }
|
---|
| 55 | Assert.IsTrue(exceptionFired);
|
---|
| 56 | // The following test checks if there is an exception when there are less than 2 parents
|
---|
| 57 | random.Reset();
|
---|
[3059] | 58 | parents = new ItemArray<IntegerVector>(new IntegerVector[] { new IntegerVector(4) });
|
---|
[3032] | 59 | exceptionFired = false;
|
---|
| 60 | try {
|
---|
[3059] | 61 | IntegerVector actual;
|
---|
[13246] | 62 | actual = (IntegerVector)target.Invoke("Cross", random, parents);
|
---|
| 63 | }
|
---|
| 64 | catch (System.ArgumentException) {
|
---|
[3032] | 65 | exceptionFired = true;
|
---|
| 66 | }
|
---|
| 67 | Assert.IsTrue(exceptionFired);
|
---|
| 68 | }
|
---|
| 69 |
|
---|
| 70 | /// <summary>
|
---|
| 71 | ///A test for Apply
|
---|
| 72 | ///</summary>
|
---|
[9885] | 73 | [TestMethod]
|
---|
| 74 | [TestCategory("Encodings.IntegerVector")]
|
---|
| 75 | [TestProperty("Time", "short")]
|
---|
[3032] | 76 | public void SinglePointCrossoverApplyTest() {
|
---|
| 77 | TestRandom random = new TestRandom();
|
---|
[3059] | 78 | IntegerVector parent1, parent2, expected, actual;
|
---|
[3032] | 79 | bool exceptionFired;
|
---|
| 80 | // The following test is not based on published examples
|
---|
| 81 | random.Reset();
|
---|
| 82 | random.IntNumbers = new int[] { 3 };
|
---|
[3059] | 83 | parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1 });
|
---|
| 84 | parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
|
---|
| 85 | expected = new IntegerVector(new int[] { 2, 2, 3, 2, 8 });
|
---|
[3032] | 86 | actual = SinglePointCrossover.Apply(random, parent1, parent2);
|
---|
[3061] | 87 | Assert.IsTrue(Auxiliary.IntegerVectorIsEqualByPosition(actual, expected));
|
---|
[3032] | 88 | // The following test is not based on published examples
|
---|
| 89 | random.Reset();
|
---|
| 90 | random.IntNumbers = new int[] { 2 };
|
---|
[3059] | 91 | parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1, 9 }); // this parent is longer
|
---|
| 92 | parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
|
---|
[3032] | 93 | exceptionFired = false;
|
---|
| 94 | try {
|
---|
| 95 | actual = SinglePointCrossover.Apply(random, parent1, parent2);
|
---|
[13246] | 96 | }
|
---|
| 97 | catch (System.ArgumentException) {
|
---|
[3032] | 98 | exceptionFired = true;
|
---|
| 99 | }
|
---|
| 100 | Assert.IsTrue(exceptionFired);
|
---|
| 101 | }
|
---|
| 102 | }
|
---|
| 103 | }
|
---|