[2854] | 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 |
|
---|
[2906] | 22 | using HeuristicLab.Core;
|
---|
[4068] | 23 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
[2854] | 24 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
| 25 |
|
---|
[3053] | 26 | namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
|
---|
[2854] | 27 | /// <summary>
|
---|
| 28 | ///This is a test class for CyclicCrossover and is intended
|
---|
| 29 | ///to contain all CyclicCrossover Unit Tests
|
---|
| 30 | ///</summary>
|
---|
| 31 | [TestClass()]
|
---|
| 32 | public class CyclicCrossoverTest {
|
---|
| 33 |
|
---|
| 34 |
|
---|
| 35 | private TestContext testContextInstance;
|
---|
| 36 |
|
---|
| 37 | /// <summary>
|
---|
| 38 | ///Gets or sets the test context which provides
|
---|
| 39 | ///information about and functionality for the current test run.
|
---|
| 40 | ///</summary>
|
---|
| 41 | public TestContext TestContext {
|
---|
| 42 | get {
|
---|
| 43 | return testContextInstance;
|
---|
| 44 | }
|
---|
| 45 | set {
|
---|
| 46 | testContextInstance = value;
|
---|
| 47 | }
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | #region Additional test attributes
|
---|
| 51 | //
|
---|
| 52 | //You can use the following additional attributes as you write your tests:
|
---|
| 53 | //
|
---|
| 54 | //Use ClassInitialize to run code before running the first test in the class
|
---|
| 55 | //[ClassInitialize()]
|
---|
| 56 | //public static void MyClassInitialize(TestContext testContext)
|
---|
| 57 | //{
|
---|
| 58 | //}
|
---|
| 59 | //
|
---|
| 60 | //Use ClassCleanup to run code after all tests in a class have run
|
---|
| 61 | //[ClassCleanup()]
|
---|
| 62 | //public static void MyClassCleanup()
|
---|
| 63 | //{
|
---|
| 64 | //}
|
---|
| 65 | //
|
---|
| 66 | //Use TestInitialize to run code before running each test
|
---|
| 67 | //[TestInitialize()]
|
---|
| 68 | //public void MyTestInitialize()
|
---|
| 69 | //{
|
---|
| 70 | //}
|
---|
| 71 | //
|
---|
| 72 | //Use TestCleanup to run code after each test has run
|
---|
| 73 | //[TestCleanup()]
|
---|
| 74 | //public void MyTestCleanup()
|
---|
| 75 | //{
|
---|
| 76 | //}
|
---|
| 77 | //
|
---|
| 78 | #endregion
|
---|
| 79 |
|
---|
| 80 |
|
---|
| 81 | /// <summary>
|
---|
| 82 | ///A test for Cross
|
---|
| 83 | ///</summary>
|
---|
| 84 | [TestMethod()]
|
---|
[3063] | 85 | [DeploymentItem("HeuristicLab.Encodings.PermutationEncoding-3.3.dll")]
|
---|
[2854] | 86 | public void CyclicCrossoverCrossTest() {
|
---|
| 87 | TestRandom random = new TestRandom();
|
---|
| 88 | CyclicCrossover_Accessor target =
|
---|
| 89 | new CyclicCrossover_Accessor(new PrivateObject(typeof(CyclicCrossover)));
|
---|
| 90 | // perform a test with more than two parents
|
---|
| 91 | random.Reset();
|
---|
| 92 | bool exceptionFired = false;
|
---|
| 93 | try {
|
---|
[3053] | 94 | target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
|
---|
[3231] | 95 | new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
|
---|
[2854] | 96 | }
|
---|
| 97 | catch (System.InvalidOperationException) {
|
---|
| 98 | exceptionFired = true;
|
---|
| 99 | }
|
---|
| 100 | Assert.IsTrue(exceptionFired);
|
---|
| 101 | }
|
---|
| 102 |
|
---|
| 103 | /// <summary>
|
---|
| 104 | ///A test for Apply
|
---|
| 105 | ///</summary>
|
---|
| 106 | [TestMethod()]
|
---|
| 107 | public void CyclicCrossoverApplyTest() {
|
---|
| 108 | TestRandom random = new TestRandom();
|
---|
[3053] | 109 | Permutation parent1, parent2, expected, actual;
|
---|
[2854] | 110 | // The following test is based on an example from Larranaga, P. et al. 1999. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13
|
---|
| 111 | random.Reset();
|
---|
| 112 | random.DoubleNumbers = new double[] { 0.9 };
|
---|
[3231] | 113 | parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
|
---|
[2854] | 114 | Assert.IsTrue(parent1.Validate());
|
---|
[3231] | 115 | parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
|
---|
[2854] | 116 | Assert.IsTrue(parent2.Validate());
|
---|
[3231] | 117 | expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 5, 3, 6, 4, 2, 7 });
|
---|
[2854] | 118 | Assert.IsTrue(expected.Validate());
|
---|
| 119 | actual = CyclicCrossover.Apply(random, parent1, parent2);
|
---|
| 120 | Assert.IsTrue(actual.Validate());
|
---|
| 121 | Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
|
---|
[2867] | 122 |
|
---|
[2854] | 123 | // perform a test when the two permutations are of unequal length
|
---|
| 124 | random.Reset();
|
---|
| 125 | bool exceptionFired = false;
|
---|
| 126 | try {
|
---|
[3231] | 127 | CyclicCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
|
---|
[2854] | 128 | }
|
---|
| 129 | catch (System.ArgumentException) {
|
---|
| 130 | exceptionFired = true;
|
---|
| 131 | }
|
---|
| 132 | Assert.IsTrue(exceptionFired);
|
---|
| 133 | }
|
---|
| 134 | }
|
---|
| 135 | }
|
---|