Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/EdgeRecombinationCrossoverTest.cs @ 10951

Last change on this file since 10951 was 9885, checked in by mkommend, 11 years ago

#2088: Merged all changesets regarding the unit test restructuring in the stable branch.

File size: 3.9 KB
RevLine 
[2854]1#region License Information
2/* HeuristicLab
[9456]3 * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[2854]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
[2906]22using HeuristicLab.Core;
[6891]23using HeuristicLab.Tests;
[2854]24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
[9885]26namespace HeuristicLab.Encodings.PermutationEncoding.Tests {
[2854]27  /// <summary>
28  ///This is a test class for EdgeRecombinationCrossover and is intended
29  ///to contain all EdgeRecombinationCrossover Unit Tests
30  ///</summary>
31  [TestClass()]
32  public class EdgeRecombinationCrossoverTest {
33    /// <summary>
34    ///A test for Cross
35    ///</summary>
[9885]36    [TestMethod]
37    [TestCategory("Encodings.Permutation")]
38    [TestProperty("Time", "short")]
[2854]39    public void EdgeRecombinationCrossoverCrossoverCrossTest() {
40      TestRandom random = new TestRandom();
41      EdgeRecombinationCrossover_Accessor target =
42        new EdgeRecombinationCrossover_Accessor(new PrivateObject(typeof(EdgeRecombinationCrossover)));
43      // perform a test with more than two parents
44      random.Reset();
45      bool exceptionFired = false;
46      try {
[3053]47        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
[3231]48          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
[9885]49      } catch (System.InvalidOperationException) {
[2854]50        exceptionFired = true;
51      }
52      Assert.IsTrue(exceptionFired);
53    }
54
55    /// <summary>
56    ///A test for Apply
57    ///</summary>
[9885]58    [TestMethod]
59    [TestCategory("Encodings.Permutation")]
60    [TestProperty("Time", "short")]
[2854]61    public void EdgeRecombinationCrossoverApplyTest() {
62      TestRandom random = new TestRandom();
[3053]63      Permutation parent1, parent2, expected, actual;
[2854]64      // The following test is based on an example from Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg, pp. 54-55
65      random.Reset();
66      random.IntNumbers = new int[] { 0 };
67      random.DoubleNumbers = new double[] { 0.5, 0, 0, 0 };
[3231]68      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
[2854]69      Assert.IsTrue(parent1.Validate());
[3231]70      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 8, 2, 6, 7, 1, 5, 4, 0, 3 });
[2854]71      Assert.IsTrue(parent2.Validate());
[3231]72      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 4, 5, 1, 7, 6, 2, 8, 3 });
[2854]73      Assert.IsTrue(expected.Validate());
74      actual = EdgeRecombinationCrossover.Apply(random, parent1, parent2);
75      Assert.IsTrue(actual.Validate());
76      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
[4068]77
[2854]78      // perform a test when the two permutations are of unequal length
79      random.Reset();
80      bool exceptionFired = false;
81      try {
[3231]82        EdgeRecombinationCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
[9885]83      } catch (System.ArgumentException) {
[2854]84        exceptionFired = true;
85      }
86      Assert.IsTrue(exceptionFired);
87    }
88  }
89}
Note: See TracBrowser for help on using the repository browser.