#region License Information /* HeuristicLab * Copyright (C) 2002-2019 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.Data; using HeuristicLab.Tests; using Microsoft.VisualStudio.TestTools.UnitTesting; namespace HeuristicLab.Encodings.RealVectorEncoding.Tests { /// ///This is a test class for BlendAlphaCrossoverTest and is intended ///to contain all BlendAlphaCrossoverTest Unit Tests /// [TestClass()] public class BlendAlphaCrossoverTest { /// ///A test for Apply /// [TestMethod()] [TestCategory("Encodings.RealVector")] [TestProperty("Time", "short")] public void BlendAlphaCrossoverApplyTest() { TestRandom random = new TestRandom(); RealVector parent1, parent2, expected, actual; DoubleValue alpha; bool exceptionFired; // The following test is not based on published examples random.Reset(); random.DoubleNumbers = new double[] { 0.5, 0.5, 0.5, 0.5, 0.5 }; alpha = new DoubleValue(0.5); 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.3, 0.15, 0.3, 0.35, 0.45 }); actual = BlendAlphaCrossover.Apply(random, parent1, parent2, alpha); Assert.IsTrue(Auxiliary.RealVectorIsAlmostEqualByPosition(actual, expected)); // The following test is not based on published examples random.Reset(); random.DoubleNumbers = new double[] { 0.25, 0.75, 0.25, 0.75, 0.25 }; alpha = new DoubleValue(0.25); 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.225, 0.1875, 0.3, 0.4625, 0.1875 }); actual = BlendAlphaCrossover.Apply(random, parent1, parent2, alpha); Assert.IsTrue(Auxiliary.RealVectorIsAlmostEqualByPosition(actual, expected)); // The following test is not based on published examples random.Reset(); random.DoubleNumbers = new double[] { 0.25, 0.75, 0.25, 0.75, 0.25 }; alpha = new DoubleValue(-0.25); // negative values for alpha are not allowed 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.225, 0.1875, 0.3, 0.4625, 0.1875 }); exceptionFired = false; try { actual = BlendAlphaCrossover.Apply(random, parent1, parent2, alpha); } catch (System.ArgumentException) { exceptionFired = true; } Assert.IsTrue(exceptionFired); // The following test is not based on published examples random.Reset(); random.DoubleNumbers = new double[] { 0.25, 0.75, 0.25, 0.75, 0.25, .75 }; alpha = new DoubleValue(0.25); 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 }); expected = new RealVector(new double[] { 0.225, 0.1875, 0.3, 0.4625, 0.1875 }); exceptionFired = false; try { actual = BlendAlphaCrossover.Apply(random, parent1, parent2, alpha); } catch (System.ArgumentException) { exceptionFired = true; } Assert.IsTrue(exceptionFired); } } }