Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/CyclicCrossover2Test.cs @ 11862

Last change on this file since 11862 was 11171, checked in by ascheibe, 10 years ago

#2115 merged r11170 (copyright update) into trunk

File size: 3.7 KB
RevLine 
[3742]1#region License Information
2/* HeuristicLab
[11171]3 * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[3742]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;
[6891]23using HeuristicLab.Tests;
[2871]24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
[9764]26namespace HeuristicLab.Encodings.PermutationEncoding.Tests {
[4068]27  /// <summary>
28  ///This is a test class for CyclicCrossover2Test and is intended
29  ///to contain all CyclicCrossover2Test Unit Tests
30  ///</summary>
[2871]31  [TestClass()]
32  public class CyclicCrossover2Test {
33    /// <summary>
34    ///A test for Cross
35    ///</summary>
[9767]36    [TestMethod]
[9777]37    [TestCategory("Encodings.Permutation")]
38    [TestProperty("Time", "short")]
[2871]39    public void CyclicCrossover2CrossTest() {
40      TestRandom random = new TestRandom();
41      CyclicCrossover2_Accessor target = new CyclicCrossover2_Accessor(new PrivateObject(typeof(CyclicCrossover2)));
42      // perform a test with more than two parents
43      random.Reset();
44      bool exceptionFired = false;
45      try {
[3053]46        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
[3231]47          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
[9777]48      } catch (System.InvalidOperationException) {
[2871]49        exceptionFired = true;
50      }
51      Assert.IsTrue(exceptionFired);
52    }
53
54    /// <summary>
55    ///A test for Apply
56    ///</summary>
[9767]57    [TestMethod]
[9777]58    [TestCategory("Encodings.Permutation")]
59    [TestProperty("Time", "short")]
[2871]60    public void CyclicCrossover2ApplyTest() {
61      TestRandom random = new TestRandom();
[3053]62      Permutation parent1, parent2, expected, actual;
[2871]63      // 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. pp. 134.
64      random.Reset();
65      random.IntNumbers = new int[] { 0 };
[3231]66      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
[2871]67      Assert.IsTrue(parent1.Validate());
[3231]68      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 5, 6, 0, 7, 1, 3, 8, 4, 9 });
[2871]69      Assert.IsTrue(parent2.Validate());
[3231]70      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 5, 2, 3, 7, 1, 6, 8, 4, 9 });
[2871]71      Assert.IsTrue(expected.Validate());
72      actual = CyclicCrossover2.Apply(random, parent1, parent2);
73      Assert.IsTrue(actual.Validate());
74      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
75
76      // perform a test when the two permutations are of unequal length
77      random.Reset();
78      bool exceptionFired = false;
79      try {
[3231]80        CyclicCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
[9777]81      } catch (System.ArgumentException) {
[2871]82        exceptionFired = true;
83      }
84      Assert.IsTrue(exceptionFired);
85    }
86  }
87}
Note: See TracBrowser for help on using the repository browser.