#region License Information /* HeuristicLab * Copyright (C) 2002-2010 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.Data; using HeuristicLab.Encodings.RealVectorEncoding; using Microsoft.VisualStudio.TestTools.UnitTesting; namespace HeuristicLab.Encodings.RealVectorEncoding_33.Tests { /// ///This is a test class for SimulatedBinaryCrossoverTest and is intended ///to contain all SimulatedBinaryCrossoverTest Unit Tests /// [TestClass()] public class SimulatedBinaryCrossoverTest { private TestContext testContextInstance; /// ///Gets or sets the test context which provides ///information about and functionality for the current test run. /// public TestContext TestContext { get { return testContextInstance; } set { testContextInstance = value; } } #region Additional test attributes // //You can use the following additional attributes as you write your tests: // //Use ClassInitialize to run code before running the first test in the class //[ClassInitialize()] //public static void MyClassInitialize(TestContext testContext) //{ //} // //Use ClassCleanup to run code after all tests in a class have run //[ClassCleanup()] //public static void MyClassCleanup() //{ //} // //Use TestInitialize to run code before running each test //[TestInitialize()] //public void MyTestInitialize() //{ //} // //Use TestCleanup to run code after each test has run //[TestCleanup()] //public void MyTestCleanup() //{ //} // #endregion /// ///A test for Cross /// [TestMethod()] [DeploymentItem("HeuristicLab.Encodings.RealVectorEncoding-3.3.dll")] public void SimulatedBinaryCrossoverCrossTest() { SimulatedBinaryCrossover_Accessor target = new SimulatedBinaryCrossover_Accessor(new PrivateObject(typeof(SimulatedBinaryCrossover))); ItemArray parents; TestRandom random = new TestRandom(); bool exceptionFired; // The following test checks if there is an exception when there are more than 2 parents random.Reset(); parents = new ItemArray(new RealVector[] { new RealVector(5), new RealVector(6), new RealVector(4) }); exceptionFired = false; try { RealVector actual; actual = target.Cross(random, parents); } catch (System.ArgumentException) { exceptionFired = true; } Assert.IsTrue(exceptionFired); // The following test checks if there is an exception when there are less than 2 parents random.Reset(); parents = new ItemArray(new RealVector[] { new RealVector(4) }); exceptionFired = false; try { RealVector actual; actual = target.Cross(random, parents); } catch (System.ArgumentException) { exceptionFired = true; } Assert.IsTrue(exceptionFired); } /// ///A test for Apply /// [TestMethod()] public void SimulatedBinaryCrossoverApplyTest() { TestRandom random = new TestRandom(); RealVector parent1, parent2, expected, actual; DoubleValue contiguity; bool exceptionFired; // The following test is not based on published examples random.Reset(); random.DoubleNumbers = new double[] { 0.3, 0.9, 0.7, 0.2, 0.8, 0.1, 0.2, 0.3, 0.4, 0.8, 0.7 }; contiguity = new DoubleValue(0.3); parent1 = new RealVector(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1 }); parent2 = new RealVector(new double[] { 0.4, 0.1, 0.3, 0.2, 0.8 }); expected = new RealVector(new double[] { 0.644880972204315, 0.0488239539275703, 0.3, 0.5, 0.1 }); actual = SimulatedBinaryCrossover.Apply(random, parent1, parent2, contiguity); Assert.IsTrue(Auxiliary.RealVectorIsAlmostEqualByPosition(actual, expected)); // The following test is not based on published examples random.Reset(); random.DoubleNumbers = new double[] { 0.3, 0.9, 0.7, 0.2, 0.8, 0.1, 0.2, 0.3, 0.4, 0.8, 0.7 }; contiguity = new DoubleValue(0.3); parent1 = new RealVector(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1, 0.9 }); // this parent is longer parent2 = new RealVector(new double[] { 0.4, 0.1, 0.3, 0.2, 0.8 }); exceptionFired = false; try { actual = SimulatedBinaryCrossover.Apply(random, parent1, parent2, contiguity); } catch (System.ArgumentException) { exceptionFired = true; } Assert.IsTrue(exceptionFired); // The following test is not based on published examples random.Reset(); random.DoubleNumbers = new double[] { 0.3, 0.9, 0.7, 0.2, 0.8, 0.1, 0.2, 0.3, 0.4, 0.8, 0.7 }; contiguity = new DoubleValue(-0.3); // contiguity < 0 parent1 = new RealVector(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1 }); parent2 = new RealVector(new double[] { 0.4, 0.1, 0.3, 0.2, 0.8 }); exceptionFired = false; try { actual = SimulatedBinaryCrossover.Apply(random, parent1, parent2, contiguity); } catch (System.ArgumentException) { exceptionFired = true; } Assert.IsTrue(exceptionFired); } /// ///A test for SimulatedBinaryCrossover Constructor /// [TestMethod()] public void SimulatedBinaryCrossoverConstructorTest() { SimulatedBinaryCrossover target = new SimulatedBinaryCrossover(); } } }