1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2019 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 |
|
---|
22 | using HeuristicLab.Tests;
|
---|
23 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
24 |
|
---|
25 | namespace HeuristicLab.Encodings.PermutationEncoding.Tests {
|
---|
26 | /// <summary>
|
---|
27 | ///This is a test class for InversionManipulator and is intended
|
---|
28 | ///to contain all InversionManipulator Unit Tests
|
---|
29 | ///</summary>
|
---|
30 | [TestClass()]
|
---|
31 | public class InversionManipulatorTest {
|
---|
32 | /// <summary>
|
---|
33 | ///A test for Apply
|
---|
34 | ///</summary>
|
---|
35 | [TestMethod]
|
---|
36 | [TestCategory("Encodings.Permutation")]
|
---|
37 | [TestProperty("Time", "short")]
|
---|
38 | public void InversionManipulatorApplyTest() {
|
---|
39 | TestRandom random = new TestRandom();
|
---|
40 | Permutation parent, expected;
|
---|
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. 46-47
|
---|
42 | random.Reset();
|
---|
43 | random.IntNumbers = new int[] { 1, 4 };
|
---|
44 | parent = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
|
---|
45 | Assert.IsTrue(parent.Validate());
|
---|
46 |
|
---|
47 | expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 4, 3, 2, 1, 5, 6, 7, 8 });
|
---|
48 | Assert.IsTrue(expected.Validate());
|
---|
49 | InversionManipulator.Apply(random, parent);
|
---|
50 | Assert.IsTrue(parent.Validate());
|
---|
51 | Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, parent));
|
---|
52 | }
|
---|
53 | }
|
---|
54 | }
|
---|