Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HiveHiveEngine/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/CosaCrossoverTest.cs @ 10207

Last change on this file since 10207 was 7259, checked in by swagner, 13 years ago

Updated year of copyrights to 2012 (#1716)

File size: 6.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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
22using HeuristicLab.Core;
23using HeuristicLab.Encodings.PermutationEncoding;
24using HeuristicLab.Tests;
25using Microsoft.VisualStudio.TestTools.UnitTesting;
26
27namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
28  /// <summary>
29  ///This is a test class for CosaCrossoverTest and is intended
30  ///to contain all CosaCrossoverTest Unit Tests
31  ///</summary>
32  [TestClass()]
33  public class CosaCrossoverTest {
34
35
36    private TestContext testContextInstance;
37
38    /// <summary>
39    ///Gets or sets the test context which provides
40    ///information about and functionality for the current test run.
41    ///</summary>
42    public TestContext TestContext {
43      get {
44        return testContextInstance;
45      }
46      set {
47        testContextInstance = value;
48      }
49    }
50
51    #region Additional test attributes
52    //
53    //You can use the following additional attributes as you write your tests:
54    //
55    //Use ClassInitialize to run code before running the first test in the class
56    //[ClassInitialize()]
57    //public static void MyClassInitialize(TestContext testContext)
58    //{
59    //}
60    //
61    //Use ClassCleanup to run code after all tests in a class have run
62    //[ClassCleanup()]
63    //public static void MyClassCleanup()
64    //{
65    //}
66    //
67    //Use TestInitialize to run code before running each test
68    //[TestInitialize()]
69    //public void MyTestInitialize()
70    //{
71    //}
72    //
73    //Use TestCleanup to run code after each test has run
74    //[TestCleanup()]
75    //public void MyTestCleanup()
76    //{
77    //}
78    //
79    #endregion
80
81
82    /// <summary>
83    ///A test for Cross
84    ///</summary>
85    [TestMethod()]
86    [DeploymentItem("HeuristicLab.Encodings.PermutationEncoding-3.3.dll")]
87    public void CosaCrossoverCrossTest() {
88      TestRandom random = new TestRandom();
89      CosaCrossover_Accessor target =
90        new CosaCrossover_Accessor(new PrivateObject(typeof(CosaCrossover)));
91      // perform a test with more than two parents
92      random.Reset();
93      bool exceptionFired = false;
94      try {
95        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
96          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
97      }
98      catch (System.InvalidOperationException) {
99        exceptionFired = true;
100      }
101      Assert.IsTrue(exceptionFired);
102    }
103
104    /// <summary>
105    ///A test for Apply
106    ///</summary>
107    [TestMethod()]
108    public void CosaCrossoverApplyTest() {
109      TestRandom random = new TestRandom();
110      Permutation parent1, parent2, expected, actual;
111      // The following test is based on an example from Wendt, O. 1994. COSA: COoperative Simulated Annealing - Integration von Genetischen Algorithmen und Simulated Annealing am Beispiel der Tourenplanung. Dissertation Thesis. IWI Frankfurt.
112      random.Reset();
113      random.IntNumbers = new int[] { 1 };
114      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 5, 2, 4, 3 });
115      Assert.IsTrue(parent1.Validate());
116      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 3, 0, 2, 1, 4, 5 });
117      Assert.IsTrue(parent2.Validate());
118      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 4, 2, 5, 3 });
119      Assert.IsTrue(expected.Validate());
120      actual = CosaCrossover.Apply(random, parent1, parent2);
121      Assert.IsTrue(actual.Validate());
122      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
123      // The following test is not based on published examples
124      random.Reset();
125      random.IntNumbers = new int[] { 4 };
126      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
127      Assert.IsTrue(parent1.Validate());
128      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
129      Assert.IsTrue(parent2.Validate());
130      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 5, 3, 4, 2, 1, 0 });
131      Assert.IsTrue(expected.Validate());
132      actual = CosaCrossover.Apply(random, parent1, parent2);
133      Assert.IsTrue(actual.Validate());
134      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
135      // The following test is not based on published examples
136      random.Reset();
137      random.IntNumbers = new int[] { 5 };
138      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
139      Assert.IsTrue(parent1.Validate());
140      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 4, 3, 5, 1, 0, 9, 7, 2, 8, 6 });
141      Assert.IsTrue(parent2.Validate());
142      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 2, 3, 4, 5, 1, 0, 9, 8 });
143      Assert.IsTrue(expected.Validate());
144      actual = CosaCrossover.Apply(random, parent1, parent2);
145      Assert.IsTrue(actual.Validate());
146      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
147
148      // perform a test when the two permutations are of unequal length
149      random.Reset();
150      bool exceptionFired = false;
151      try {
152        CosaCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
153      }
154      catch (System.ArgumentException) {
155        exceptionFired = true;
156      }
157      Assert.IsTrue(exceptionFired);
158    }
159  }
160}
Note: See TracBrowser for help on using the repository browser.