#region License Information
/* HeuristicLab
* Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using HeuristicLab.Core;
using HeuristicLab.Encodings.PermutationEncoding;
using HeuristicLab.Encodings.ScheduleEncoding.JobSequenceMatrix;
using HeuristicLab.Tests;
using Microsoft.VisualStudio.TestTools.UnitTesting;
namespace HeuristicLab.Encodings.ScheduleEncoding.Tests {
///
///This is a test class for JSMSXXCrossoverTest and is intended
///to contain all JSMSXXCrossoverTest Unit Tests
///
[TestClass()]
public class JSMSXXCrossoverTest {
///
///A test for Apply
///
[TestMethod]
[TestCategory("Encodings.Schedule")]
[TestProperty("Time", "short")]
public void ApplyTest() {
IRandom random = new TestRandom(new int[] { 3 }, null);
JSMEncoding p1 = TestUtils.CreateTestJSM1();
JSMEncoding p2 = TestUtils.CreateTestJSM2();
JSMEncoding expected = new JSMEncoding();
ItemList jsm = new ItemList();
for (int i = 0; i < 6; i++) {
jsm.Add(new Permutation(PermutationTypes.Absolute, new int[] { 2, 1, 0, 3, 4, 5 }));
}
expected.JobSequenceMatrix = jsm;
JSMEncoding actual;
actual = JSMSXXCrossover.Apply(random, p1, p2);
Assert.IsTrue(TestUtils.JSMEncodingEquals(expected, actual));
}
}
}