Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Tests/HeuristicLab.Encodings.RealVectorEncoding-3.3/SimulatedBinaryCrossoverTest.cs @ 13246

Last change on this file since 13246 was 13246, checked in by ascheibe, 8 years ago

#2510 merged r13227, r13235, r13236 into stable

File size: 3.6 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
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
22using HeuristicLab.Data;
23using HeuristicLab.Tests;
24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
26namespace HeuristicLab.Encodings.RealVectorEncoding.Tests {
27  /// <summary>
28  ///This is a test class for SimulatedBinaryCrossoverTest and is intended
29  ///to contain all SimulatedBinaryCrossoverTest Unit Tests
30  ///</summary>
31  [TestClass()]
32  public class SimulatedBinaryCrossoverTest {
33    /// <summary>
34    ///A test for Apply
35    ///</summary>
36    [TestMethod()]
37    [TestCategory("Encodings.RealVector")]
38    [TestProperty("Time", "short")]
39    public void SimulatedBinaryCrossoverApplyTest() {
40      TestRandom random = new TestRandom();
41      RealVector parent1, parent2, expected, actual;
42      DoubleValue contiguity;
43      bool exceptionFired;
44      // The following test is not based on published examples
45      random.Reset();
46      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 };
47      contiguity = new DoubleValue(0.3);
48      parent1 = new RealVector(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1 });
49      parent2 = new RealVector(new double[] { 0.4, 0.1, 0.3, 0.2, 0.8 });
50      expected = new RealVector(new double[] { 0.644880972204315, 0.0488239539275703, 0.3, 0.5, 0.1 });
51      actual = SimulatedBinaryCrossover.Apply(random, parent1, parent2, contiguity);
52      Assert.IsTrue(Auxiliary.RealVectorIsAlmostEqualByPosition(actual, expected));
53      // The following test is not based on published examples
54      random.Reset();
55      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 };
56      contiguity = new DoubleValue(0.3);
57      parent1 = new RealVector(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1, 0.9 }); // this parent is longer
58      parent2 = new RealVector(new double[] { 0.4, 0.1, 0.3, 0.2, 0.8 });
59      exceptionFired = false;
60      try {
61        actual = SimulatedBinaryCrossover.Apply(random, parent1, parent2, contiguity);
62      }
63      catch (System.ArgumentException) {
64        exceptionFired = true;
65      }
66      Assert.IsTrue(exceptionFired);
67      // The following test is not based on published examples
68      random.Reset();
69      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 };
70      contiguity = new DoubleValue(-0.3);  //  contiguity < 0
71      parent1 = new RealVector(new double[] { 0.2, 0.2, 0.3, 0.5, 0.1 });
72      parent2 = new RealVector(new double[] { 0.4, 0.1, 0.3, 0.2, 0.8 });
73      exceptionFired = false;
74      try {
75        actual = SimulatedBinaryCrossover.Apply(random, parent1, parent2, contiguity);
76      }
77      catch (System.ArgumentException) {
78        exceptionFired = true;
79      }
80      Assert.IsTrue(exceptionFired);
81    }
82  }
83}
Note: See TracBrowser for help on using the repository browser.