Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/UniformLikeCrossoverTest.cs @ 12939

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

#2212 merged r12008, r12009, r12010 back into trunk

File size: 3.1 KB
RevLine 
[8924]1#region License Information
2/* HeuristicLab
[12012]3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[8924]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;
[6056]24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
[9764]26namespace HeuristicLab.Encodings.PermutationEncoding.Tests {
[6056]27  /// <summary>
28  ///This is a test class for UniformLikeCrossoverTest and is intended
29  ///to contain all UniformLikeCrossoverTest Unit Tests
30  ///</summary>
31  [TestClass()]
32  public class UniformLikeCrossoverTest {
33    /// <summary>
34    ///A test for Apply
35    ///</summary>
[9767]36    [TestMethod]
[9777]37    [TestCategory("Encodings.Permutation")]
38    [TestProperty("Time", "short")]
[6056]39    public void UniformLikeCrossoverApplyTest() {
40      // test from the paper
41      IRandom random = new TestRandom(new int[] { 0 }, new double[] { 0.2, 0.7, 0.2, 0.2 }); // TODO: Initialize to an appropriate value
42      Permutation parent1 = new Permutation(PermutationTypes.Absolute,
43        new int[] { 3, 2, 0, 7, 5, 4, 1, 6 });
44      Assert.IsTrue(parent1.Validate());
45      Permutation parent2 = new Permutation(PermutationTypes.Absolute,
46        new int[] { 5, 0, 4, 7, 1, 3, 2, 6 });
47      Assert.IsTrue(parent2.Validate());
48      Permutation expected = new Permutation(PermutationTypes.Absolute,
49        new int[] { 3, 0, 4, 7, 5, 2, 1, 6 });
50      Assert.IsTrue(expected.Validate());
51      Permutation actual;
52      actual = UniformLikeCrossover.Apply(random, parent1, parent2);
53      Assert.IsTrue(actual.Validate());
54      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
55    }
56
57    /// <summary>
58    ///A test for Cross
59    ///</summary>
[9767]60    [TestMethod]
[9777]61    [TestCategory("Encodings.Permutation")]
62    [TestProperty("Time", "short")]
[6056]63    public void UniformLikeCrossoverCrossTest() {
64      UniformLikeCrossover_Accessor target = new UniformLikeCrossover_Accessor();
65      IRandom random = new TestRandom(new int[] { }, new double[] { 0.1, 0.2, 0.3, 0.4 });
66      random.Reset();
67      bool exceptionFired = false;
68      try {
69        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
70          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
71      } catch (System.InvalidOperationException) {
72        exceptionFired = true;
73      }
74      Assert.IsTrue(exceptionFired);
75    }
76  }
77}
Note: See TracBrowser for help on using the repository browser.