Free cookie consent management tool by TermsFeed Policy Generator

source: branches/irace/HeuristicLab.Tests/HeuristicLab.Encodings.PermutationEncoding-3.3/OrderCrossoverTest.cs @ 12501

Last change on this file since 12501 was 11171, checked in by ascheibe, 10 years ago

#2115 merged r11170 (copyright update) into trunk
File size: 7.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2014 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.Core;
23using HeuristicLab.Tests;
24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
26namespace HeuristicLab.Encodings.PermutationEncoding.Tests {
27  /// <summary>
28  ///This is a test class for OrderCrossoverTest and is intended
29  ///to contain all OrderCrossoverTest Unit Tests
30  ///</summary>
31  [TestClass()]
32  public class OrderCrossoverTest {
33    /// <summary>
34    ///A test for Cross
35    ///</summary>
36    [TestMethod]
37    [TestCategory("Encodings.Permutation")]
38    [TestProperty("Time", "short")]
39    public void OrderCrossoverCrossTest() {
40      TestRandom random = new TestRandom();
41      OrderCrossover_Accessor target =
42        new OrderCrossover_Accessor(new PrivateObject(typeof(OrderCrossover)));
43      // perform a test with more than two parents
44      random.Reset();
45      bool exceptionFired = false;
46      try {
47        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
48          new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4), new Permutation(PermutationTypes.RelativeUndirected, 4)}));
49      } catch (System.InvalidOperationException) {
50        exceptionFired = true;
51      }
52      Assert.IsTrue(exceptionFired);
53    }
54
55    /// <summary>
56    ///A test for Apply
57    ///</summary>
58    [TestMethod]
59    [TestCategory("Encodings.Permutation")]
60    [TestProperty("Time", "short")]
61    public void OrderCrossoverApplyTest() {
62      TestRandom random = new TestRandom();
63      Permutation parent1, parent2, expected, actual;
64      // 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
65      random.Reset();
66      random.IntNumbers = new int[] { 3, 6 };
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[] { 8, 2, 6, 7, 1, 5, 4, 0, 3 });
70      Assert.IsTrue(parent2.Validate());
71      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 7, 1, 3, 4, 5, 6, 0, 8 });
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 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.
77      random.Reset();
78      random.IntNumbers = new int[] { 2, 4 };
79      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
80      Assert.IsTrue(parent1.Validate());
81      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
82      Assert.IsTrue(parent2.Validate());
83      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 2, 3, 4, 0, 1, 5 });
84      actual = OrderCrossover.Apply(random, parent1, parent2);
85      Assert.IsTrue(actual.Validate());
86      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
87      // The following test is based on an example from Talbi, E.G. 2009. Metaheuristics - From Design to Implementation. Wiley, p. 218.
88      random.Reset();
89      random.IntNumbers = new int[] { 2, 5 };
90      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
91      Assert.IsTrue(parent1.Validate());
92      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 3, 0, 4, 8, 2, 5, 1, 6 });
93      Assert.IsTrue(parent2.Validate());
94      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 8, 2, 3, 4, 5, 1, 6, 7 });
95      Assert.IsTrue(expected.Validate());
96      actual = OrderCrossover.Apply(random, parent1, parent2);
97      Assert.IsTrue(actual.Validate());
98      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
99      // The following test is not based on published examples
100      random.Reset();
101      random.IntNumbers = new int[] { 0, 5 };
102      parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 1, 4, 3, 7, 8, 6, 0, 5, 9 });
103      Assert.IsTrue(parent1.Validate());
104      parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 5, 3, 4, 0, 9, 8, 2, 7, 1, 6 });
105      Assert.IsTrue(parent2.Validate());
106      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 1, 4, 3, 7, 8, 6, 5, 0, 9 });
107      Assert.IsTrue(expected.Validate());
108      actual = OrderCrossover.Apply(random, parent1, parent2);
109      Assert.IsTrue(actual.Validate());
110      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
111      // based on the previous with changed breakpoints
112      random.Reset();
113      random.IntNumbers = new int[] { 6, 9 };
114      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 3, 4, 8, 2, 7, 1, 6, 0, 5, 9 });
115      Assert.IsTrue(expected.Validate());
116      actual = OrderCrossover.Apply(random, parent1, parent2);
117      Assert.IsTrue(actual.Validate());
118      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
119      // another one based on the previous with changed breakpoints
120      random.Reset();
121      random.IntNumbers = new int[] { 0, 9 };
122      expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 2, 1, 4, 3, 7, 8, 6, 0, 5, 9 });
123      Assert.IsTrue(expected.Validate());
124      actual = OrderCrossover.Apply(random, parent1, parent2);
125      Assert.IsTrue(actual.Validate());
126      Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
127
128      // perform a test when the two permutations are of unequal length
129      random.Reset();
130      bool exceptionFired = false;
131      try {
132        OrderCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
133      } catch (System.ArgumentException) {
134        exceptionFired = true;
135      }
136      Assert.IsTrue(exceptionFired);
137    }
138  }
139}
Note: See TracBrowser for help on using the repository browser.