| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 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 CosaCrossoverTest and is intended
|
|---|
| 28 | ///to contain all CosaCrossoverTest Unit Tests
|
|---|
| 29 | ///</summary>
|
|---|
| 30 | [TestClass()]
|
|---|
| 31 | public class CosaCrossoverTest {
|
|---|
| 32 | /// <summary>
|
|---|
| 33 | ///A test for Apply
|
|---|
| 34 | ///</summary>
|
|---|
| 35 | [TestMethod]
|
|---|
| 36 | [TestCategory("Encodings.Permutation")]
|
|---|
| 37 | [TestProperty("Time", "short")]
|
|---|
| 38 | public void CosaCrossoverApplyTest() {
|
|---|
| 39 | TestRandom random = new TestRandom();
|
|---|
| 40 | Permutation parent1, parent2, expected, actual;
|
|---|
| 41 | // The following test is based on an example from Wendt, O. 1994. COSA: COoperative Simulated Annealing - Integration von Genetischen Algorithmen und Simulated Annealing am Beispiel der Tourenplanung. Dissertation Thesis. IWI Frankfurt.
|
|---|
| 42 | random.Reset();
|
|---|
| 43 | random.IntNumbers = new int[] { 1 };
|
|---|
| 44 | parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 5, 2, 4, 3 });
|
|---|
| 45 | Assert.IsTrue(parent1.Validate());
|
|---|
| 46 | parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 3, 0, 2, 1, 4, 5 });
|
|---|
| 47 | Assert.IsTrue(parent2.Validate());
|
|---|
| 48 | expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 4, 2, 5, 3 });
|
|---|
| 49 | Assert.IsTrue(expected.Validate());
|
|---|
| 50 | actual = CosaCrossover.Apply(random, parent1, parent2);
|
|---|
| 51 | Assert.IsTrue(actual.Validate());
|
|---|
| 52 | Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
|
|---|
| 53 | // The following test is not based on published examples
|
|---|
| 54 | random.Reset();
|
|---|
| 55 | random.IntNumbers = new int[] { 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, 5, 3, 4, 2, 1, 0 });
|
|---|
| 61 | Assert.IsTrue(expected.Validate());
|
|---|
| 62 | actual = CosaCrossover.Apply(random, parent1, parent2);
|
|---|
| 63 | Assert.IsTrue(actual.Validate());
|
|---|
| 64 | Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
|
|---|
| 65 | // The following test is not based on published examples
|
|---|
| 66 | random.Reset();
|
|---|
| 67 | random.IntNumbers = new int[] { 5 };
|
|---|
| 68 | parent1 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
|
|---|
| 69 | Assert.IsTrue(parent1.Validate());
|
|---|
| 70 | parent2 = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 4, 3, 5, 1, 0, 9, 7, 2, 8, 6 });
|
|---|
| 71 | Assert.IsTrue(parent2.Validate());
|
|---|
| 72 | expected = new Permutation(PermutationTypes.RelativeUndirected, new int[] { 7, 6, 2, 3, 4, 5, 1, 0, 9, 8 });
|
|---|
| 73 | Assert.IsTrue(expected.Validate());
|
|---|
| 74 | actual = CosaCrossover.Apply(random, parent1, parent2);
|
|---|
| 75 | Assert.IsTrue(actual.Validate());
|
|---|
| 76 | Assert.IsTrue(Auxiliary.PermutationIsEqualByPosition(expected, actual));
|
|---|
| 77 |
|
|---|
| 78 | // perform a test when the two permutations are of unequal length
|
|---|
| 79 | random.Reset();
|
|---|
| 80 | bool exceptionFired = false;
|
|---|
| 81 | try {
|
|---|
| 82 | CosaCrossover.Apply(random, new Permutation(PermutationTypes.RelativeUndirected, 8), new Permutation(PermutationTypes.RelativeUndirected, 6));
|
|---|
| 83 | }
|
|---|
| 84 | catch (System.ArgumentException) {
|
|---|
| 85 | exceptionFired = true;
|
|---|
| 86 | }
|
|---|
| 87 | Assert.IsTrue(exceptionFired);
|
|---|
| 88 | }
|
|---|
| 89 | }
|
|---|
| 90 | }
|
|---|
