Changeset 2867 for trunk/sources/HeuristicLab.Permutation

Timestamp:

02/25/10 17:22:13 (15 years ago)

Author:

abeham

Message:

Added tests from our book for OX, PMX and CX.
Corrected a mistake in the MPX test regarding the name of one test
The tests currently fail with the new implementations.
#889

Location:

trunk/sources/HeuristicLab.Permutation/3.3/Tests

Files:

• CyclicCrossoverTest.cs (modified) (1 diff)
• MaximalPreservativeCrossoverTest.cs (modified) (1 diff)
• OrderCrossoverTest.cs (modified) (1 diff)
• PartiallyMatchedCrossoverTest.cs (modified) (1 diff)

trunk/sources/HeuristicLab.Permutation/3.3/Tests/CyclicCrossoverTest.cs

@@ -122 +122 @@
       Assert.IsTrue(actual.Validate());
       Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
-     
+      // 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. pp. 134.
+      random.Reset();
+      random.DoubleNumbers = new double[] { 0.9 };
+      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
+      Assert.IsTrue(parent1.Validate());
+      parent2 = new Permutation(new int[] { 2, 5, 6, 0, 7, 1, 3, 8, 4, 9 });
+      Assert.IsTrue(parent2.Validate());
+      expected = new Permutation(new int[] { 0, 5, 2, 3, 7, 1, 6, 8, 4, 9 });
+      Assert.IsTrue(expected.Validate());
+      actual = CyclicCrossover.Apply(random, parent1, parent2);
+      Assert.IsTrue(actual.Validate());
+      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
+
       // perform a test when the two permutations are of unequal length
       random.Reset();

trunk/sources/HeuristicLab.Permutation/3.3/Tests/MaximalPreservativeCrossoverTest.cs

@@ -86 +86 @@
     [TestMethod()]
     [DeploymentItem("HeuristicLab.Permutation-3.3.dll")]
-    public void CyclicCrossoverCrossTest() {
+    public void MaximalPreservativeCrossoverCrossTest() {
       TestRandom random = new TestRandom();
       MaximalPreservativeCrossover_Accessor target =

trunk/sources/HeuristicLab.Permutation/3.3/Tests/OrderCrossoverTest.cs

@@ -173 +173 @@
       Assert.IsTrue(actual.Validate());
       Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
+      // 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. 135.
+      random.Reset();
+      random.IntNumbers = new int[] { 2, 5 };
+      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
+      Assert.IsTrue(parent1.Validate());
+      parent2 = new Permutation(new int[] { 2, 5, 6, 0, 9, 1, 3, 8, 4, 7 });
+      Assert.IsTrue(parent2.Validate());
+      expected = new Permutation(new int[] { 2, 0, 9, 1, 3, 5, 6, 7, 8, 4 });
+      Assert.IsTrue(expected.Validate());
+      actual = OrderCrossover.Apply(random, parent1, parent2);
+      Assert.IsTrue(actual.Validate());
+      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
+
       // perform a test when the two permutations are of unequal length
       random.Reset();

trunk/sources/HeuristicLab.Permutation/3.3/Tests/PartiallyMatchedCrossoverTest.cs

@@ -122 +122 @@
       Assert.IsTrue(actual.Validate());
       Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
-     
+      // 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.
+      random.Reset();
+      random.IntNumbers = new int[] { 5, 7 };
+      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
+      Assert.IsTrue(parent1.Validate());
+      parent2 = new Permutation(new int[] { 2, 5, 6, 0, 9, 1, 3, 8, 4, 7 });
+      Assert.IsTrue(parent2.Validate());
+      expected = new Permutation(new int[] { 2, 1, 3, 0, 9, 5, 6, 7, 4, 8 });
+      Assert.IsTrue(expected.Validate());
+      actual = PartiallyMatchedCrossover.Apply(random, parent1, parent2);
+      Assert.IsTrue(actual.Validate());
+      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
+
       // perform a test when the two permutations are of unequal length
       random.Reset();