Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HiveHiveEngine/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/OrderCrossover2Test.cs @ 12996

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

Updated year of copyrights to 2012 (#1716)

File size: 4.8 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 OrderCrossover2Test and is intended
30  ///to contain all OrderCrossover2Test Unit Tests
31  ///</summary>
32  [TestClass()]
33  public class OrderCrossover2Test {
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 OrderCrossover2CrossTest() {
88      TestRandom random = new TestRandom();
89      OrderCrossover2_Accessor target = new OrderCrossover2_Accessor(new PrivateObject(typeof(OrderCrossover2)));
90      random.Reset();
91      bool exceptionFired = false;
92      try {
93        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
94          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
95      }
96      catch (System.InvalidOperationException) {
97        exceptionFired = true;
98      }
99      Assert.IsTrue(exceptionFired);
100    }
101
102    /// <summary>
103    ///A test for Apply
104    ///</summary>
105    [TestMethod()]
106    public void OrderCrossover2ApplyTest() {
107      TestRandom random = new TestRandom();
108      Permutation parent1, parent2, expected, actual;
109      // The following test is based on an example from Affenzeller, M. et al. 2009. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications. CRC Press. p. 135.
110      random.Reset();
111      random.IntNumbers = new int[] { 5, 7 };
112      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
113      Assert.IsTrue(parent1.Validate());
114      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 5, 6, 0, 9, 1, 3, 8, 4, 7 });
115      Assert.IsTrue(parent2.Validate());
116      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 0, 9, 1, 3, 5, 6, 7, 8, 4 });
117      Assert.IsTrue(expected.Validate());
118      actual = OrderCrossover2.Apply(random, parent1, parent2);
119      Assert.IsTrue(actual.Validate());
120      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
121
122      // perform a test when the two permutations are of unequal length
123      random.Reset();
124      bool exceptionFired = false;
125      try {
126        OrderCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
127      }
128      catch (System.ArgumentException) {
129        exceptionFired = true;
130      }
131      Assert.IsTrue(exceptionFired);
132    }
133  }
134}
Note: See TracBrowser for help on using the repository browser.