Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/CosaCrossoverTest.cs @ 4019

Last change on this file since 4019 was 3376, checked in by swagner, 15 years ago

Moved interfaces and classes for deep cloning from HeuristicLab.Core to HeuristicLab.Common (#975).

File size: 6.4 KB
RevLine 
[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
[3376]22using HeuristicLab.Common;
[2906]23using HeuristicLab.Core;
[2854]24using Microsoft.VisualStudio.TestTools.UnitTesting;
[3053]25using HeuristicLab.Encodings.PermutationEncoding;
[2854]26
[3053]27namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
[2854]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()]
[3063]86    [DeploymentItem("HeuristicLab.Encodings.PermutationEncoding-3.3.dll")]
[2854]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 {
[3053]95        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
[3231]96          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
[2854]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();
[3053]109      Permutation parent1, parent2, expected, actual;
[2879]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.
[2854]111      random.Reset();
[2879]112      random.IntNumbers = new int[] { 1 };
[3231]113      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 5, 2, 4, 3 });
[2879]114      Assert.IsTrue(parent1.Validate());
[3231]115      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 3, 0, 2, 1, 4, 5 });
[2879]116      Assert.IsTrue(parent2.Validate());
[3231]117      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 4, 2, 5, 3 });
[2879]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();
[2854]124      random.IntNumbers = new int[] { 4 };
[3231]125      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
[2854]126      Assert.IsTrue(parent1.Validate());
[3231]127      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
[2854]128      Assert.IsTrue(parent2.Validate());
[3231]129      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 5, 3, 4, 2, 1, 0 });
[2854]130      Assert.IsTrue(expected.Validate());
131      actual = CosaCrossover.Apply(random, parent1, parent2);
132      Assert.IsTrue(actual.Validate());
133      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
[2879]134      // The following test is not based on published examples
135      random.Reset();
136      random.IntNumbers = new int[] { 5 };
[3231]137      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
[2879]138      Assert.IsTrue(parent1.Validate());
[3231]139      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 4, 3, 5, 1, 0, 9, 7, 2, 8, 6 });
[2879]140      Assert.IsTrue(parent2.Validate());
[3231]141      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 2, 3, 4, 5, 1, 0, 9, 8 });
[2879]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     
[2854]147      // perform a test when the two permutations are of unequal length
148      random.Reset();
149      bool exceptionFired = false;
150      try {
[3231]151        CosaCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
[2854]152      } catch (System.ArgumentException) {
153        exceptionFired = true;
154      }
155      Assert.IsTrue(exceptionFired);
156    }
157  }
158}
Note: See TracBrowser for help on using the repository browser.