Free cookie consent management tool by TermsFeed Policy Generator

source: branches/OptimizationNetworks/HeuristicLab.Tests/HeuristicLab.Encodings.IntegerVectorEncoding-3.3/DiscreteCrossoverTest.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: 3.6 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;
[6891]23using HeuristicLab.Tests;
[3032]24using Microsoft.VisualStudio.TestTools.UnitTesting;
25
[9764]26namespace HeuristicLab.Encodings.IntegerVectorEncoding.Tests {
[3032]27  /// <summary>
28  ///This is a test class for DiscreteCrossoverTest and is intended
29  ///to contain all DiscreteCrossoverTest Unit Tests
30  ///</summary>
31  [TestClass()]
32  public class DiscreteCrossoverTest {
33    /// <summary>
34    ///A test for Cross
35    ///</summary>
[9766]36    [TestMethod]
[9777]37    [TestCategory("Encodings.IntegerVector")]
38    [TestProperty("Time", "short")]
[3032]39    public void DiscreteCrossoverCrossTest() {
40      DiscreteCrossover_Accessor target = new DiscreteCrossover_Accessor(new PrivateObject(typeof(DiscreteCrossover)));
[3059]41      ItemArray<IntegerVector> parents;
[3032]42      TestRandom random = new TestRandom();
43      bool exceptionFired;
44      // The following test checks if there is an exception when there are less than 2 parents
45      random.Reset();
[3059]46      parents = new ItemArray<IntegerVector>(new IntegerVector[] { new IntegerVector(4) });
[3032]47      exceptionFired = false;
48      try {
[3061]49        IntegerVector actual;
[3032]50        actual = target.Cross(random, parents);
[9777]51      } catch (System.ArgumentException) {
[3032]52        exceptionFired = true;
53      }
54      Assert.IsTrue(exceptionFired);
55    }
56
57    /// <summary>
58    ///A test for Apply
59    ///</summary>
[9766]60    [TestMethod]
[9777]61    [TestCategory("Encodings.IntegerVector")]
62    [TestProperty("Time", "short")]
[3032]63    public void DiscreteCrossoverApplyTest() {
64      TestRandom random = new TestRandom();
[3059]65      IntegerVector parent1, parent2, expected, actual;
[3032]66      bool exceptionFired;
67      // The following test is not based on published examples
68      random.Reset();
[8023]69      random.IntNumbers = new int[] { 0, 0, 1, 0, 1 };
[3059]70      parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1 });
71      parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
72      expected = new IntegerVector(new int[] { 2, 2, 3, 5, 8 });
[8019]73      actual = DiscreteCrossover.Apply(random, new ItemArray<IntegerVector>(new IntegerVector[] { parent1, parent2 }));
[3061]74      Assert.IsTrue(Auxiliary.IntegerVectorIsEqualByPosition(actual, expected));
[3032]75
76      // The following test is not based on published examples
77      random.Reset();
[8023]78      random.IntNumbers = new int[] { 0, 0, 1, 0, 1 };
[3059]79      parent1 = new IntegerVector(new int[] { 2, 2, 3, 5, 1, 9 }); // this parent is longer
80      parent2 = new IntegerVector(new int[] { 4, 1, 3, 2, 8 });
[3032]81      exceptionFired = false;
82      try {
[8019]83        actual = DiscreteCrossover.Apply(random, new ItemArray<IntegerVector>(new IntegerVector[] { parent1, parent2 }));
[9777]84      } catch (System.ArgumentException) {
[3032]85        exceptionFired = true;
86      }
87      Assert.IsTrue(exceptionFired);
88    }
89  }
90}
Note: See TracBrowser for help on using the repository browser.