Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/PositionBasedCrossoverTest.cs @ 14625

Last change on this file since 14625 was 14354, checked in by bburlacu, 8 years ago

#2685: Revert accidental commit.

File size: 2.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 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.Tests;
23using Microsoft.VisualStudio.TestTools.UnitTesting;
24
25namespace HeuristicLab.Encodings.PermutationEncoding.Tests {
26  /// <summary>
27  ///This is a test class for PositionBasedCrossover and is intended
28  ///to contain all PositionBasedCrossover Unit Tests
29  ///</summary>
30  [TestClass()]
31  public class PositionBasedCrossoverTest {
32    /// <summary>
33    ///A test for Apply
34    ///</summary>
35    [TestMethod]
36    [TestCategory("Encodings.Permutation")]
37    [TestProperty("Time", "short")]
38    public void PositionBasedCrossoverApplyTest() {
39      TestRandom random = new TestRandom();
40      Permutation parent1, parent2, expected, actual;
41
42      // The following test is based on an example from Larranaga, 1999. Genetic Algorithms for the Traveling Salesman Problem.
43      random.Reset();
44      random.IntNumbers = new int[] { 3, 1, 2, 5 };
45      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
46      Assert.IsTrue(parent1.Validate());
47      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
48      Assert.IsTrue(parent2.Validate());
49
50      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 3, 5, 1, 2, 4, 6, 7 });
51      Assert.IsTrue(expected.Validate());
52      actual = PositionBasedCrossover.Apply(random, parent1, parent2);
53      Assert.IsTrue(actual.Validate());
54      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
55
56      // perform a test when two permutations are of unequal length
57      random.Reset();
58      bool exceptionFired = false;
59      try {
60        PositionBasedCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
61      }
62      catch (System.ArgumentException) {
63        exceptionFired = true;
64      }
65      Assert.IsTrue(exceptionFired);
66    }
67  }
68}
Note: See TracBrowser for help on using the repository browser.