Free cookie consent management tool by TermsFeed Policy Generator

source: branches/Scheduling/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/CosaCrossoverTest.cs @ 6307

Last change on this file since 6307 was 5445, checked in by swagner, 14 years ago

Updated year of copyrights (#1406)

File size: 6.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 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 Microsoft.VisualStudio.TestTools.UnitTesting;
25
26namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
27  /// <summary>
28  ///This is a test class for CosaCrossoverTest and is intended
29  ///to contain all CosaCrossoverTest Unit Tests
30  ///</summary>
31  [TestClass()]
32  public class CosaCrossoverTest {
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()]
85    [DeploymentItem("HeuristicLab.Encodings.PermutationEncoding-3.3.dll")]
86    public void CosaCrossoverCrossTest() {
87      TestRandom random = new TestRandom();
88      CosaCrossover_Accessor target =
89        new CosaCrossover_Accessor(new PrivateObject(typeof(CosaCrossover)));
90      // perform a test with more than two parents
91      random.Reset();
92      bool exceptionFired = false;
93      try {
94        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
95          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
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 CosaCrossoverApplyTest() {
108      TestRandom random = new TestRandom();
109      Permutation parent1, parent2, expected, actual;
110      // 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.
111      random.Reset();
112      random.IntNumbers = new int[] { 1 };
113      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 5, 2, 4, 3 });
114      Assert.IsTrue(parent1.Validate());
115      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 3, 0, 2, 1, 4, 5 });
116      Assert.IsTrue(parent2.Validate());
117      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 4, 2, 5, 3 });
118      Assert.IsTrue(expected.Validate());
119      actual = CosaCrossover.Apply(random, parent1, parent2);
120      Assert.IsTrue(actual.Validate());
121      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
122      // The following test is not based on published examples
123      random.Reset();
124      random.IntNumbers = new int[] { 4 };
125      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
126      Assert.IsTrue(parent1.Validate());
127      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
128      Assert.IsTrue(parent2.Validate());
129      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 5, 3, 4, 2, 1, 0 });
130      Assert.IsTrue(expected.Validate());
131      actual = CosaCrossover.Apply(random, parent1, parent2);
132      Assert.IsTrue(actual.Validate());
133      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
134      // The following test is not based on published examples
135      random.Reset();
136      random.IntNumbers = new int[] { 5 };
137      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
138      Assert.IsTrue(parent1.Validate());
139      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 4, 3, 5, 1, 0, 9, 7, 2, 8, 6 });
140      Assert.IsTrue(parent2.Validate());
141      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 2, 3, 4, 5, 1, 0, 9, 8 });
142      Assert.IsTrue(expected.Validate());
143      actual = CosaCrossover.Apply(random, parent1, parent2);
144      Assert.IsTrue(actual.Validate());
145      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
146
147      // perform a test when the two permutations are of unequal length
148      random.Reset();
149      bool exceptionFired = false;
150      try {
151        CosaCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
152      }
153      catch (System.ArgumentException) {
154        exceptionFired = true;
155      }
156      Assert.IsTrue(exceptionFired);
157    }
158  }
159}
Note: See TracBrowser for help on using the repository browser.