Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistentDataStructures/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/OrderCrossoverTest.cs @ 14927

Last change on this file since 14927 was 14186, checked in by swagner, 8 years ago

#2526: Updated year of copyrights in license headers

File size: 6.2 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 OrderCrossoverTest and is intended
28  ///to contain all OrderCrossoverTest Unit Tests
29  ///</summary>
30  [TestClass()]
31  public class OrderCrossoverTest {
32    /// <summary>
33    ///A test for Apply
34    ///</summary>
35    [TestMethod]
36    [TestCategory("Encodings.Permutation")]
37    [TestProperty("Time", "short")]
38    public void OrderCrossoverApplyTest() {
39      TestRandom random = new TestRandom();
40      Permutation parent1, parent2, expected, actual;
41      // The following test is based on an example from Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg, pp. 55-56
42      random.Reset();
43      random.IntNumbers = new int[] { 3, 6 };
44      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
45      Assert.IsTrue(parent1.Validate());
46      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 8, 2, 6, 7, 1, 5, 4, 0, 3 });
47      Assert.IsTrue(parent2.Validate());
48      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 7, 1, 3, 4, 5, 6, 0, 8 });
49      Assert.IsTrue(expected.Validate());
50      actual = OrderCrossover.Apply(random, parent1, parent2);
51      Assert.IsTrue(actual.Validate());
52      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
53      // The following test is based on an example from Larranaga, P. et al. 1999. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13, pp. 129-170.
54      random.Reset();
55      random.IntNumbers = new int[] { 2, 4 };
56      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
57      Assert.IsTrue(parent1.Validate());
58      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
59      Assert.IsTrue(parent2.Validate());
60      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 2, 3, 4, 0, 1, 5 });
61      actual = OrderCrossover.Apply(random, parent1, parent2);
62      Assert.IsTrue(actual.Validate());
63      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
64      // The following test is based on an example from Talbi, E.G. 2009. Metaheuristics - From Design to Implementation. Wiley, p. 218.
65      random.Reset();
66      random.IntNumbers = new int[] { 2, 5 };
67      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
68      Assert.IsTrue(parent1.Validate());
69      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 3, 0, 4, 8, 2, 5, 1, 6 });
70      Assert.IsTrue(parent2.Validate());
71      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 8, 2, 3, 4, 5, 1, 6, 7 });
72      Assert.IsTrue(expected.Validate());
73      actual = OrderCrossover.Apply(random, parent1, parent2);
74      Assert.IsTrue(actual.Validate());
75      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
76      // The following test is not based on published examples
77      random.Reset();
78      random.IntNumbers = new int[] { 0, 5 };
79      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 1, 4, 3, 7, 8, 6, 0, 5, 9 });
80      Assert.IsTrue(parent1.Validate());
81      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 5, 3, 4, 0, 9, 8, 2, 7, 1, 6 });
82      Assert.IsTrue(parent2.Validate());
83      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 1, 4, 3, 7, 8, 6, 5, 0, 9 });
84      Assert.IsTrue(expected.Validate());
85      actual = OrderCrossover.Apply(random, parent1, parent2);
86      Assert.IsTrue(actual.Validate());
87      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
88      // based on the previous with changed breakpoints
89      random.Reset();
90      random.IntNumbers = new int[] { 6, 9 };
91      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 3, 4, 8, 2, 7, 1, 6, 0, 5, 9 });
92      Assert.IsTrue(expected.Validate());
93      actual = OrderCrossover.Apply(random, parent1, parent2);
94      Assert.IsTrue(actual.Validate());
95      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
96      // another one based on the previous with changed breakpoints
97      random.Reset();
98      random.IntNumbers = new int[] { 0, 9 };
99      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 1, 4, 3, 7, 8, 6, 0, 5, 9 });
100      Assert.IsTrue(expected.Validate());
101      actual = OrderCrossover.Apply(random, parent1, parent2);
102      Assert.IsTrue(actual.Validate());
103      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
104
105      // perform a test when the two permutations are of unequal length
106      random.Reset();
107      bool exceptionFired = false;
108      try {
109        OrderCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
110      }
111      catch (System.ArgumentException) {
112        exceptionFired = true;
113      }
114      Assert.IsTrue(exceptionFired);
115    }
116  }
117}
Note: See TracBrowser for help on using the repository browser.