Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.Permutation/3.3/Tests/CyclicCrossoverTest.cs @ 2906

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

Operator architecture refactoring (#95)

  • renamed HeuristicLab.Permutation to HeuristicLab.Encodings.Permutation
File size: 4.7 KB
Line 
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
22using HeuristicLab.Core;
23using Microsoft.VisualStudio.TestTools.UnitTesting;
24
25namespace HeuristicLab.Encodings.Permutation.Tests {
26  /// <summary>
27  ///This is a test class for CyclicCrossover and is intended
28  ///to contain all CyclicCrossover Unit Tests
29  ///</summary>
30  [TestClass()]
31  public class CyclicCrossoverTest {
32
33
34    private TestContext testContextInstance;
35
36    /// <summary>
37    ///Gets or sets the test context which provides
38    ///information about and functionality for the current test run.
39    ///</summary>
40    public TestContext TestContext {
41      get {
42        return testContextInstance;
43      }
44      set {
45        testContextInstance = value;
46      }
47    }
48
49    #region Additional test attributes
50    //
51    //You can use the following additional attributes as you write your tests:
52    //
53    //Use ClassInitialize to run code before running the first test in the class
54    //[ClassInitialize()]
55    //public static void MyClassInitialize(TestContext testContext)
56    //{
57    //}
58    //
59    //Use ClassCleanup to run code after all tests in a class have run
60    //[ClassCleanup()]
61    //public static void MyClassCleanup()
62    //{
63    //}
64    //
65    //Use TestInitialize to run code before running each test
66    //[TestInitialize()]
67    //public void MyTestInitialize()
68    //{
69    //}
70    //
71    //Use TestCleanup to run code after each test has run
72    //[TestCleanup()]
73    //public void MyTestCleanup()
74    //{
75    //}
76    //
77    #endregion
78
79
80    /// <summary>
81    ///A test for Cross
82    ///</summary>
83    [TestMethod()]
84    [DeploymentItem("HeuristicLab.Encodings.Permutation-3.3.dll")]
85    public void CyclicCrossoverCrossTest() {
86      TestRandom random = new TestRandom();
87      CyclicCrossover_Accessor target =
88        new CyclicCrossover_Accessor(new PrivateObject(typeof(CyclicCrossover)));
89      // perform a test with more than two parents
90      random.Reset();
91      bool exceptionFired = false;
92      try {
93        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
94          new Permutation(4), new Permutation(4), new Permutation(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 CyclicCrossoverApplyTest() {
107      TestRandom random = new TestRandom();
108      Permutation parent1, parent2, expected, actual;
109      // 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
110      random.Reset();
111      random.DoubleNumbers = new double[] { 0.9 };
112      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
113      Assert.IsTrue(parent1.Validate());
114      parent2 = new Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
115      Assert.IsTrue(parent2.Validate());
116      expected = new Permutation(new int[] { 0, 1, 5, 3, 6, 4, 2, 7 });
117      Assert.IsTrue(expected.Validate());
118      actual = CyclicCrossover.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        CyclicCrossover.Apply(random, new Permutation(8), new Permutation(6));
127      }
128      catch (System.ArgumentException) {
129        exceptionFired = true;
130      }
131      Assert.IsTrue(exceptionFired);
132    }
133
134    /// <summary>
135    ///A test for OrderCrossover Constructor
136    ///</summary>
137    [TestMethod()]
138    public void CyclicCrossoverConstructorTest() {
139      CyclicCrossover target = new CyclicCrossover();
140    }
141  }
142}
Note: See TracBrowser for help on using the repository browser.