Free cookie consent management tool by TermsFeed Policy Generator

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

Last change on this file since 12064 was 12012, checked in by ascheibe, 10 years ago

#2212 merged r12008, r12009, r12010 back into trunk

File size: 5.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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.Tests;
24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
26namespace HeuristicLab.Encodings.PermutationEncoding.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    /// <summary>
34    ///A test for Cross
35    ///</summary>
36    [TestMethod]
37    [TestCategory("Encodings.Permutation")]
38    [TestProperty("Time", "short")]
39    public void CosaCrossoverCrossTest() {
40      TestRandom random = new TestRandom();
41      CosaCrossover_Accessor target =
42        new CosaCrossover_Accessor(new PrivateObject(typeof(CosaCrossover)));
43      // perform a test with more than two parents
44      random.Reset();
45      bool exceptionFired = false;
46      try {
47        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
48          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
49      } catch (System.InvalidOperationException) {
50        exceptionFired = true;
51      }
52      Assert.IsTrue(exceptionFired);
53    }
54
55    /// <summary>
56    ///A test for Apply
57    ///</summary>
58    [TestMethod]
59    [TestCategory("Encodings.Permutation")]
60    [TestProperty("Time", "short")]
61    public void CosaCrossoverApplyTest() {
62      TestRandom random = new TestRandom();
63      Permutation parent1, parent2, expected, actual;
64      // 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.
65      random.Reset();
66      random.IntNumbers = new int[] { 1 };
67      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 5, 2, 4, 3 });
68      Assert.IsTrue(parent1.Validate());
69      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 3, 0, 2, 1, 4, 5 });
70      Assert.IsTrue(parent2.Validate());
71      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 4, 2, 5, 3 });
72      Assert.IsTrue(expected.Validate());
73      actual = CosaCrossover.Apply(random, parent1, parent2);
74      Assert.IsTrue(actual.Validate());
75      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
76      // The following test is not based on published examples
77      random.Reset();
78      random.IntNumbers = new int[] { 4 };
79      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
80      Assert.IsTrue(parent1.Validate());
81      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
82      Assert.IsTrue(parent2.Validate());
83      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 5, 3, 4, 2, 1, 0 });
84      Assert.IsTrue(expected.Validate());
85      actual = CosaCrossover.Apply(random, parent1, parent2);
86      Assert.IsTrue(actual.Validate());
87      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
88      // The following test is not based on published examples
89      random.Reset();
90      random.IntNumbers = new int[] { 5 };
91      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
92      Assert.IsTrue(parent1.Validate());
93      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 4, 3, 5, 1, 0, 9, 7, 2, 8, 6 });
94      Assert.IsTrue(parent2.Validate());
95      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 2, 3, 4, 5, 1, 0, 9, 8 });
96      Assert.IsTrue(expected.Validate());
97      actual = CosaCrossover.Apply(random, parent1, parent2);
98      Assert.IsTrue(actual.Validate());
99      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
100
101      // perform a test when the two permutations are of unequal length
102      random.Reset();
103      bool exceptionFired = false;
104      try {
105        CosaCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
106      } catch (System.ArgumentException) {
107        exceptionFired = true;
108      }
109      Assert.IsTrue(exceptionFired);
110    }
111  }
112}
Note: See TracBrowser for help on using the repository browser.