Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
03/16/10 00:56:44 (14 years ago)
Author:
swagner
Message:

Renamed solution encoding plugins (#909)

Location:
trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3
Files:
2 edited

Legend:

Unmodified
Added
Removed

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3

    • Property svn:ignore

      •  

        old new  
        22bin
        33obj
        4 HeuristicLabEncodingsPermutationPlugin.cs
         4HeuristicLabEncodingsPermutationEncodingPlugin.cs

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/PositionBasedCrossoverTest.cs

    r2930 r3053  
    2222using HeuristicLab.Core;
    2323using Microsoft.VisualStudio.TestTools.UnitTesting;
    24 using HeuristicLab.Encodings.Permutation;
     24using HeuristicLab.Encodings.PermutationEncoding;
    2525
    26 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     26namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2727  /// <summary>
    2828  ///This is a test class for PositionBasedCrossover and is intended
    … …  
    9393      bool exceptionFired = false;
    9494      try {
    95         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    96           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4) }));
     95        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     96          new Permutation(4), new Permutation(4), new Permutation(4) }));
    9797      }
    9898      catch (System.InvalidOperationException) {
    … …  
    109109    public void PositionBasedCrossoverApplyTest() {
    110110      TestRandom random = new TestRandom();
    111       Permutation.Permutation parent1, parent2, expected, actual;
     111      Permutation parent1, parent2, expected, actual;
    112112
    113113      // The following test is based on an example from Larranaga, 1999. Genetic Algorithms for the Traveling Salesman Problem.
    114114      random.Reset();
    115115      random.IntNumbers = new int[] { 3, 1, 2, 5 };
    116       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     116      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    117117      Assert.IsTrue(parent1.Validate());
    118       parent2 = new Permutation.Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
     118      parent2 = new Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
    119119      Assert.IsTrue(parent2.Validate());
    120120
    121       expected = new Permutation.Permutation(new int[] { 0, 3, 5, 1, 2, 4, 6, 7 });
     121      expected = new Permutation(new int[] { 0, 3, 5, 1, 2, 4, 6, 7 });
    122122      Assert.IsTrue(expected.Validate());
    123123      actual = PositionBasedCrossover.Apply(random, parent1, parent2);
    … …  
    129129      bool exceptionFired = false;
    130130      try {
    131         PositionBasedCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     131        PositionBasedCrossover.Apply(random, new Permutation(8), new Permutation(6));
    132132      } catch (System.ArgumentException) {
    133133        exceptionFired = true;
Note: See TracChangeset for help on using the changeset viewer.