#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.IntegerVectorEncoding;
using HeuristicLab.Encodings.ScheduleEncoding.PermutationWithRepetition;
using HeuristicLab.Tests;
using Microsoft.VisualStudio.TestTools.UnitTesting;
namespace HeuristicLab.Encodings.ScheduleEncoding.Tests {
///
///This is a test class for PWRPPXCrossoverTest and is intended
///to contain all PWRPPXCrossoverTest Unit Tests
///
[TestClass()]
public class PWRPPXCrossoverTest {
///
///A test for Apply
///
[TestMethod]
[TestCategory("Encodings.Schedule")]
[TestProperty("Time", "short")]
public void ApplyTest() {
IRandom random = new TestRandom(new int[] { 1, 1, 0, 0, 1, 1, 0, 0, 1 }, null);
PWREncoding parent1 = TestUtils.CreateTestPWR1();
PWREncoding parent2 = TestUtils.CreateTestPWR2();
PWREncoding expected = new PWREncoding();
expected.PermutationWithRepetition = new IntegerVector(new int[] { 1, 0, 1, 0, 1, 2, 0, 2, 2 });
PWREncoding actual;
actual = PWRPPXCrossover.Apply(random, parent1, parent2);
Assert.IsTrue(actual.Equals(expected));
}
}
}