Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/PartiallyMatchedCrossoverTest.cs @ 12858

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

#2212 merged r12008, r12009, r12010 back into trunk

File size: 4.6 KB
RevLine 
[2854]1#region License Information
2/* HeuristicLab
[12012]3 * Copyright (C) 2002-2015 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 PartiallyMatchedCrossover and is intended
29  ///to contain all PartiallyMatchedCrossover Unit Tests
30  ///</summary>
31  [TestClass()]
32  public class PartiallyMatchedCrossoverTest {
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 PartiallyMatchedCrossTest() {
40      TestRandom random = new TestRandom();
41      PartiallyMatchedCrossover_Accessor target =
42        new PartiallyMatchedCrossover_Accessor(new PrivateObject(typeof(PartiallyMatchedCrossover)));
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)}));
[9777]49      } catch (System.InvalidOperationException) {
[2854]50        exceptionFired = true;
51      }
52      Assert.IsTrue(exceptionFired);
53    }
54
55    /// <summary>
56    ///A test for Apply
57    ///</summary>
[9767]58    [TestMethod]
[9777]59    [TestCategory("Encodings.Permutation")]
60    [TestProperty("Time", "short")]
[2854]61    public void PartiallyMatchedCrossoverApplyTest() {
62      TestRandom random = new TestRandom();
[3053]63      Permutation parent1, parent2, expected, actual;
[2854]64      // The following test is based on an example from Larranaga, 1999. Genetic Algorithms for the Traveling Salesman Problem.
65      random.Reset();
66      random.IntNumbers = new int[] { 3, 5 };
[3231]67      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
[2854]68      Assert.IsTrue(parent1.Validate());
[3231]69      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 6, 4, 0, 5, 7, 1, 3 });
[2854]70      Assert.IsTrue(parent2.Validate());
[3231]71      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 6, 7, 3, 4, 5, 1, 0 });
[2854]72      Assert.IsTrue(expected.Validate());
73      actual = PartiallyMatchedCrossover.Apply(random, parent1, parent2);
74      Assert.IsTrue(actual.Validate());
75      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
[2867]76      // 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. p. 134.
77      random.Reset();
78      random.IntNumbers = new int[] { 5, 7 };
[3231]79      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
[2867]80      Assert.IsTrue(parent1.Validate());
[3231]81      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 5, 6, 0, 9, 1, 3, 8, 4, 7 });
[2867]82      Assert.IsTrue(parent2.Validate());
[3231]83      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 1, 3, 0, 9, 5, 6, 7, 4, 8 });
[2867]84      Assert.IsTrue(expected.Validate());
85      actual = PartiallyMatchedCrossover.Apply(random, parent1, parent2);
86      Assert.IsTrue(actual.Validate());
87      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
88
[2854]89      // perform a test when the two permutations are of unequal length
90      random.Reset();
91      bool exceptionFired = false;
92      try {
[3231]93        PartiallyMatchedCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
[9777]94      } catch (System.ArgumentException) {
[2854]95        exceptionFired = true;
96      }
97      Assert.IsTrue(exceptionFired);
98    }
99  }
100}
Note: See TracBrowser for help on using the repository browser.