Free cookie consent management tool by TermsFeed Policy Generator

source: branches/OptimizationNetworks/HeuristicLab.Tests/HeuristicLab.Encodings.RealVectorEncoding-3.3/SimulatedBinaryCrossoverTest.cs @ 12009

Last change on this file since 12009 was 11576, checked in by swagner, 10 years ago

#2205: Merged changes r11062:11557 from trunk/sources into branches/OptimizationNetworks

File size: 5.0 KB
RevLine 
[3742]1#region License Information
2/* HeuristicLab
[11576]3 * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[3742]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
[4068]22using HeuristicLab.Core;
23using HeuristicLab.Data;
[6891]24using HeuristicLab.Tests;
[2936]25using Microsoft.VisualStudio.TestTools.UnitTesting;
26
[9764]27namespace HeuristicLab.Encodings.RealVectorEncoding.Tests {
[2936]28  /// <summary>
29  ///This is a test class for SimulatedBinaryCrossoverTest and is intended
30  ///to contain all SimulatedBinaryCrossoverTest Unit Tests
31  ///</summary>
32  [TestClass()]
33  public class SimulatedBinaryCrossoverTest {
34    /// <summary>
35    ///A test for Cross
36    ///</summary>
[9777]37    [TestMethod()]
38    [TestCategory("Encodings.RealVector")]
39    [TestProperty("Time", "short")]
[2936]40    public void SimulatedBinaryCrossoverCrossTest() {
41      SimulatedBinaryCrossover_Accessor target = new SimulatedBinaryCrossover_Accessor(new PrivateObject(typeof(SimulatedBinaryCrossover)));
[3060]42      ItemArray<RealVector> parents;
[2936]43      TestRandom random = new TestRandom();
44      bool exceptionFired;
45      // The following test checks if there is an exception when there are more than 2 parents
46      random.Reset();
[3060]47      parents = new ItemArray<RealVector>(new RealVector[] { new RealVector(5), new RealVector(6), new RealVector(4) });
[2936]48      exceptionFired = false;
49      try {
[3060]50        RealVector actual;
[2936]51        actual = target.Cross(random, parents);
[4872]52      } catch (System.ArgumentException) {
[2936]53        exceptionFired = true;
54      }
55      Assert.IsTrue(exceptionFired);
56      // The following test checks if there is an exception when there are less than 2 parents
57      random.Reset();
[3060]58      parents = new ItemArray<RealVector>(new RealVector[] { new RealVector(4) });
[2936]59      exceptionFired = false;
60      try {
[3060]61        RealVector actual;
[2936]62        actual = target.Cross(random, parents);
[4872]63      } catch (System.ArgumentException) {
[2936]64        exceptionFired = true;
65      }
66      Assert.IsTrue(exceptionFired);
67    }
68
69    /// <summary>
70    ///A test for Apply
71    ///</summary>
[9777]72    [TestMethod()]
73    [TestCategory("Encodings.RealVector")]
74    [TestProperty("Time", "short")]
[2936]75    public void SimulatedBinaryCrossoverApplyTest() {
76      TestRandom random = new TestRandom();
[3060]77      RealVector parent1, parent2, expected, actual;
[3048]78      DoubleValue contiguity;
[2936]79      bool exceptionFired;
80      // The following test is not based on published examples
81      random.Reset();
82      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 };
[3048]83      contiguity = new DoubleValue(0.3);
[3060]84      parent1 = new RealVector(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1 });
85      parent2 = new RealVector(new double[] { 0.4, 0.1, 0.3, 0.2, 0.8 });
[4872]86      expected = new RealVector(new double[] { 0.644880972204315, 0.0488239539275703, 0.3, 0.5, 0.1 });
[2936]87      actual = SimulatedBinaryCrossover.Apply(random, parent1, parent2, contiguity);
[3061]88      Assert.IsTrue(Auxiliary.RealVectorIsAlmostEqualByPosition(actual, expected));
[2936]89      // The following test is not based on published examples
90      random.Reset();
91      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 };
[3048]92      contiguity = new DoubleValue(0.3);
[3060]93      parent1 = new RealVector(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1, 0.9 }); // this parent is longer
94      parent2 = new RealVector(new double[] { 0.4, 0.1, 0.3, 0.2, 0.8 });
[2936]95      exceptionFired = false;
96      try {
97        actual = SimulatedBinaryCrossover.Apply(random, parent1, parent2, contiguity);
[4872]98      } catch (System.ArgumentException) {
[2936]99        exceptionFired = true;
100      }
101      Assert.IsTrue(exceptionFired);
102      // The following test is not based on published examples
103      random.Reset();
104      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 };
[3048]105      contiguity = new DoubleValue(-0.3);  //  contiguity < 0
[4068]106      parent1 = new RealVector(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1 });
[3060]107      parent2 = new RealVector(new double[] { 0.4, 0.1, 0.3, 0.2, 0.8 });
[2936]108      exceptionFired = false;
109      try {
110        actual = SimulatedBinaryCrossover.Apply(random, parent1, parent2, contiguity);
[4872]111      } catch (System.ArgumentException) {
[2936]112        exceptionFired = true;
113      }
114      Assert.IsTrue(exceptionFired);
115    }
116  }
117}
Note: See TracBrowser for help on using the repository browser.