Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/PositionBasedCrossoverTest.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 
[2854]1#region License Information
2/* HeuristicLab
[11171]3 * Copyright (C) 2002-2014 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
[9764]26namespace HeuristicLab.Encodings.PermutationEncoding.Tests {
[2854]27  /// <summary>
28  ///This is a test class for PositionBasedCrossover and is intended
29  ///to contain all PositionBasedCrossover Unit Tests
30  ///</summary>
31  [TestClass()]
32  public class PositionBasedCrossoverTest {
33    /// <summary>
34    ///A test for Cross
35    ///</summary>
[9767]36    [TestMethod]
[9777]37    [TestCategory("Encodings.Permutation")]
38    [TestProperty("Time", "short")]
[2854]39    public void PositionBasedCrossoverCrossTest() {
40      TestRandom random = new TestRandom();
41      PositionBasedCrossover_Accessor target = new PositionBasedCrossover_Accessor(
42        new PrivateObject(typeof(PositionBasedCrossover)));
[4068]43
[2854]44      // perform a test with more than two parents
45      random.Reset();
46      bool exceptionFired = false;
47      try {
[3053]48        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
[3231]49          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4) }));
[9777]50      } catch (System.InvalidOperationException) {
[2854]51        exceptionFired = true;
52      }
53      Assert.IsTrue(exceptionFired);
54    }
55
56    /// <summary>
57    ///A test for Apply
58    ///</summary>
[9767]59    [TestMethod]
[9777]60    [TestCategory("Encodings.Permutation")]
61    [TestProperty("Time", "short")]
[2854]62    public void PositionBasedCrossoverApplyTest() {
63      TestRandom random = new TestRandom();
[3053]64      Permutation parent1, parent2, expected, actual;
[2854]65
66      // The following test is based on an example from Larranaga, 1999. Genetic Algorithms for the Traveling Salesman Problem.
67      random.Reset();
68      random.IntNumbers = new int[] { 3, 1, 2, 5 };
[3231]69      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
[2854]70      Assert.IsTrue(parent1.Validate());
[3231]71      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
[2854]72      Assert.IsTrue(parent2.Validate());
73
[3231]74      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 3, 5, 1, 2, 4, 6, 7 });
[2854]75      Assert.IsTrue(expected.Validate());
76      actual = PositionBasedCrossover.Apply(random, parent1, parent2);
77      Assert.IsTrue(actual.Validate());
78      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
79
80      // perform a test when two permutations are of unequal length
81      random.Reset();
82      bool exceptionFired = false;
83      try {
[3231]84        PositionBasedCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
[9777]85      } catch (System.ArgumentException) {
[2854]86        exceptionFired = true;
87      }
88      Assert.IsTrue(exceptionFired);
89    }
90  }
91}
Note: See TracBrowser for help on using the repository browser.