[8924] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17181] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[8924] | 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.Core;
|
---|
[6406] | 23 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
| 24 | using HeuristicLab.Encodings.ScheduleEncoding.JobSequenceMatrix;
|
---|
[8888] | 25 | using HeuristicLab.Tests;
|
---|
[6406] | 26 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
| 27 |
|
---|
[9885] | 28 | namespace HeuristicLab.Encodings.ScheduleEncoding.Tests {
|
---|
[6406] | 29 | /// <summary>
|
---|
| 30 | ///This is a test class for JSMJOXCrossoverTest and is intended
|
---|
| 31 | ///to contain all JSMJOXCrossoverTest Unit Tests
|
---|
| 32 | ///</summary>
|
---|
| 33 | [TestClass()]
|
---|
| 34 | public class JSMJOXCrossoverTest {
|
---|
| 35 | /// <summary>
|
---|
| 36 | ///A test for Apply
|
---|
| 37 | ///</summary>
|
---|
[9885] | 38 | [TestMethod]
|
---|
| 39 | [TestCategory("Encodings.Schedule")]
|
---|
| 40 | [TestProperty("Time", "short")]
|
---|
[6406] | 41 | public void ApplyTest() {
|
---|
| 42 | IRandom random = new TestRandom(new int[] { 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1 }, null);
|
---|
| 43 | JSMEncoding p1 = TestUtils.CreateTestJSM1();
|
---|
| 44 | JSMEncoding p2 = TestUtils.CreateTestJSM2();
|
---|
| 45 | JSMEncoding expected = new JSMEncoding();
|
---|
| 46 | ItemList<Permutation> jsm = new ItemList<Permutation>();
|
---|
| 47 | for (int i = 0; i < 6; i++) {
|
---|
| 48 | jsm.Add(new Permutation(PermutationTypes.Absolute, new int[] { 5, 4, 3, 0, 1, 2 }));
|
---|
| 49 | }
|
---|
| 50 | expected.JobSequenceMatrix = jsm;
|
---|
| 51 |
|
---|
| 52 | JSMEncoding actual;
|
---|
| 53 | actual = JSMJOXCrossover.Apply(random, p1, p2);
|
---|
| 54 |
|
---|
[11073] | 55 | Assert.IsTrue(TestUtils.JSMEncodingEquals(expected, actual));
|
---|
[6406] | 56 | }
|
---|
| 57 | }
|
---|
| 58 | }
|
---|