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:
22 edited
1 moved

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/Auxiliary.cs

    r2930 r3053  
    2020#endregion
    2121
    22 using HeuristicLab.Encodings.Permutation;
     22using HeuristicLab.Encodings.PermutationEncoding;
    2323
    24 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     24namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2525  public static class Auxiliary {
    26     public static bool PermutationIsEqualByPosition(Permutation.Permutation p1, Permutation.Permutation p2) {
     26    public static bool PermutationIsEqualByPosition(Permutation p1, Permutation p2) {
    2727      bool equal = (p1.Length == p2.Length);
    2828      if (equal) {

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/CosaCrossoverTest.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 CosaCrossoverTest and is intended
    … …  
    9292      bool exceptionFired = false;
    9393      try {
    94         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    95           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     94        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     95          new Permutation(4), new Permutation(4), new Permutation(4)}));
    9696      } catch (System.InvalidOperationException) {
    9797        exceptionFired = true;
    … …  
    106106    public void CosaCrossoverApplyTest() {
    107107      TestRandom random = new TestRandom();
    108       Permutation.Permutation parent1, parent2, expected, actual;
     108      Permutation parent1, parent2, expected, actual;
    109109      // The following test is based on an example from Wendt, O. 1994. COSA: COoperative Simulated Annealing - Integration von Genetischen Algorithmen und Simulated Annealing am Beispiel der Tourenplanung. Dissertation Thesis. IWI Frankfurt.
    110110      random.Reset();
    111111      random.IntNumbers = new int[] { 1 };
    112       parent1 = new Permutation.Permutation(new int[] { 0, 1, 5, 2, 4, 3 });
     112      parent1 = new Permutation(new int[] { 0, 1, 5, 2, 4, 3 });
    113113      Assert.IsTrue(parent1.Validate());
    114       parent2 = new Permutation.Permutation(new int[] { 3, 0, 2, 1, 4, 5 });
     114      parent2 = new Permutation(new int[] { 3, 0, 2, 1, 4, 5 });
    115115      Assert.IsTrue(parent2.Validate());
    116       expected = new Permutation.Permutation(new int[] { 0, 1, 4, 2, 5, 3 });
     116      expected = new Permutation(new int[] { 0, 1, 4, 2, 5, 3 });
    117117      Assert.IsTrue(expected.Validate());
    118118      actual = CosaCrossover.Apply(random, parent1, parent2);
    … …  
    122122      random.Reset();
    123123      random.IntNumbers = new int[] { 4 };
    124       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     124      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    125125      Assert.IsTrue(parent1.Validate());
    126       parent2 = new Permutation.Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
     126      parent2 = new Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
    127127      Assert.IsTrue(parent2.Validate());
    128       expected = new Permutation.Permutation(new int[] { 7, 6, 5, 3, 4, 2, 1, 0 });
     128      expected = new Permutation(new int[] { 7, 6, 5, 3, 4, 2, 1, 0 });
    129129      Assert.IsTrue(expected.Validate());
    130130      actual = CosaCrossover.Apply(random, parent1, parent2);
    … …  
    134134      random.Reset();
    135135      random.IntNumbers = new int[] { 5 };
    136       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
     136      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
    137137      Assert.IsTrue(parent1.Validate());
    138       parent2 = new Permutation.Permutation(new int[] { 4, 3, 5, 1, 0, 9, 7, 2, 8, 6 });
     138      parent2 = new Permutation(new int[] { 4, 3, 5, 1, 0, 9, 7, 2, 8, 6 });
    139139      Assert.IsTrue(parent2.Validate());
    140       expected = new Permutation.Permutation(new int[] { 7, 6, 2, 3, 4, 5, 1, 0, 9, 8 });
     140      expected = new Permutation(new int[] { 7, 6, 2, 3, 4, 5, 1, 0, 9, 8 });
    141141      Assert.IsTrue(expected.Validate());
    142142      actual = CosaCrossover.Apply(random, parent1, parent2);
    … …  
    148148      bool exceptionFired = false;
    149149      try {
    150         CosaCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     150        CosaCrossover.Apply(random, new Permutation(8), new Permutation(6));
    151151      } catch (System.ArgumentException) {
    152152        exceptionFired = true;

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

    r2930 r3053  
    11using HeuristicLab.Core;
    22using Microsoft.VisualStudio.TestTools.UnitTesting;
    3 using HeuristicLab.Encodings.Permutation;
     3using HeuristicLab.Encodings.PermutationEncoding;
    44
    5 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     5namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    66    /// <summary>
    77    ///This is a test class for CyclicCrossover2Test and is intended
    … …  
    7070      bool exceptionFired = false;
    7171      try {
    72         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    73           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     72        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     73          new Permutation(4), new Permutation(4), new Permutation(4)}));
    7474      } catch (System.InvalidOperationException) {
    7575        exceptionFired = true;
    … …  
    8484    public void CyclicCrossover2ApplyTest() {
    8585      TestRandom random = new TestRandom();
    86       Permutation.Permutation parent1, parent2, expected, actual;
     86      Permutation parent1, parent2, expected, actual;
    8787      // The following test is based on an example from Affenzeller, M. et al. 2009. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications. CRC Press. pp. 134.
    8888      random.Reset();
    8989      random.IntNumbers = new int[] { 0 };
    90       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
     90      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
    9191      Assert.IsTrue(parent1.Validate());
    92       parent2 = new Permutation.Permutation(new int[] { 2, 5, 6, 0, 7, 1, 3, 8, 4, 9 });
     92      parent2 = new Permutation(new int[] { 2, 5, 6, 0, 7, 1, 3, 8, 4, 9 });
    9393      Assert.IsTrue(parent2.Validate());
    94       expected = new Permutation.Permutation(new int[] { 0, 5, 2, 3, 7, 1, 6, 8, 4, 9 });
     94      expected = new Permutation(new int[] { 0, 5, 2, 3, 7, 1, 6, 8, 4, 9 });
    9595      Assert.IsTrue(expected.Validate());
    9696      actual = CyclicCrossover2.Apply(random, parent1, parent2);
    … …  
    102102      bool exceptionFired = false;
    103103      try {
    104         CyclicCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     104        CyclicCrossover.Apply(random, new Permutation(8), new Permutation(6));
    105105      } catch (System.ArgumentException) {
    106106        exceptionFired = true;

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/CyclicCrossoverTest.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 CyclicCrossover and is intended
    … …  
    9292      bool exceptionFired = false;
    9393      try {
    94         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    95           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     94        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     95          new Permutation(4), new Permutation(4), new Permutation(4)}));
    9696      }
    9797      catch (System.InvalidOperationException) {
    … …  
    107107    public void CyclicCrossoverApplyTest() {
    108108      TestRandom random = new TestRandom();
    109       Permutation.Permutation parent1, parent2, expected, actual;
     109      Permutation parent1, parent2, expected, actual;
    110110      // The following test is based on an example from Larranaga, P. et al. 1999. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13
    111111      random.Reset();
    112112      random.DoubleNumbers = new double[] { 0.9 };
    113       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     113      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    114114      Assert.IsTrue(parent1.Validate());
    115       parent2 = new Permutation.Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
     115      parent2 = new Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
    116116      Assert.IsTrue(parent2.Validate());
    117       expected = new Permutation.Permutation(new int[] { 0, 1, 5, 3, 6, 4, 2, 7 });
     117      expected = new Permutation(new int[] { 0, 1, 5, 3, 6, 4, 2, 7 });
    118118      Assert.IsTrue(expected.Validate());
    119119      actual = CyclicCrossover.Apply(random, parent1, parent2);
    … …  
    125125      bool exceptionFired = false;
    126126      try {
    127         CyclicCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     127        CyclicCrossover.Apply(random, new Permutation(8), new Permutation(6));
    128128      }
    129129      catch (System.ArgumentException) {

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/EdgeRecombinationCrossoverTest.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 EdgeRecombinationCrossover and is intended
    … …  
    9292      bool exceptionFired = false;
    9393      try {
    94         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    95           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     94        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     95          new Permutation(4), new Permutation(4), new Permutation(4)}));
    9696      }
    9797      catch (System.InvalidOperationException) {
    … …  
    107107    public void EdgeRecombinationCrossoverApplyTest() {
    108108      TestRandom random = new TestRandom();
    109       Permutation.Permutation parent1, parent2, expected, actual;
     109      Permutation parent1, parent2, expected, actual;
    110110      // The following test is based on an example from Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg, pp. 54-55
    111111      random.Reset();
    112112      random.IntNumbers = new int[] { 0 };
    113113      random.DoubleNumbers = new double[] { 0.5, 0, 0, 0 };
    114       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
     114      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
    115115      Assert.IsTrue(parent1.Validate());
    116       parent2 = new Permutation.Permutation(new int[] { 8, 2, 6, 7, 1, 5, 4, 0, 3 });
     116      parent2 = new Permutation(new int[] { 8, 2, 6, 7, 1, 5, 4, 0, 3 });
    117117      Assert.IsTrue(parent2.Validate());
    118       expected = new Permutation.Permutation(new int[] { 0, 4, 5, 1, 7, 6, 2, 8, 3 });
     118      expected = new Permutation(new int[] { 0, 4, 5, 1, 7, 6, 2, 8, 3 });
    119119      Assert.IsTrue(expected.Validate());
    120120      actual = EdgeRecombinationCrossover.Apply(random, parent1, parent2);
    … …  
    126126      bool exceptionFired = false;
    127127      try {
    128         EdgeRecombinationCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     128        EdgeRecombinationCrossover.Apply(random, new Permutation(8), new Permutation(6));
    129129      }
    130130      catch (System.ArgumentException) {

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/HeuristicLab.Encodings.PermutationEncoding-3.3.Tests.csproj

    r3052 r3053  
    55    <ProductVersion>9.0.30729</ProductVersion>
    66    <SchemaVersion>2.0</SchemaVersion>
    7     <ProjectGuid>{4D59BEC9-A69E-4686-B8C9-0E6C073B093E}</ProjectGuid>
     7    <ProjectGuid>{13CA37D6-4111-4E7B-BE2E-AF3DE462D384}</ProjectGuid>
    88    <OutputType>Library</OutputType>
    99    <AppDesignerFolder>Properties</AppDesignerFolder>
    10     <RootNamespace>HeuristicLab.Encodings.Permutation_33.Tests</RootNamespace>
    11     <AssemblyName>HeuristicLab.Encodings.Permutation-3.3.Tests</AssemblyName>
     10    <RootNamespace>HeuristicLab.Encodings.PermutationEncoding_33.Tests</RootNamespace>
     11    <AssemblyName>HeuristicLab.Encodings.PermutationEncoding-3.3.Tests</AssemblyName>
    1212    <TargetFrameworkVersion>v3.5</TargetFrameworkVersion>
    1313    <FileAlignment>512</FileAlignment>
    … …  
    135135      <Name>HeuristicLab.PluginInfrastructure</Name>
    136136    </ProjectReference>
    137     <ProjectReference Include="..\HeuristicLab.Encodings.Permutation-3.3.csproj">
    138       <Project>{00282156-589D-424F-9CE4-A8038636C926}</Project>
    139       <Name>HeuristicLab.Encodings.Permutation-3.3</Name>
     137    <ProjectReference Include="..\HeuristicLab.Encodings.PermutationEncoding-3.3.csproj">
     138      <Project>{DBECB8B0-B166-4133-BAF1-ED67C3FD7FCA}</Project>
     139      <Name>HeuristicLab.Encodings.PermutationEncoding-3.3</Name>
    140140    </ProjectReference>
    141141  </ItemGroup>

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

    r2930 r3053  
    2121
    2222using Microsoft.VisualStudio.TestTools.UnitTesting;
    23 using HeuristicLab.Encodings.Permutation;
     23using HeuristicLab.Encodings.PermutationEncoding;
    2424
    25 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     25namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2626  /// <summary>
    2727  ///This is a test class for InsertionManipulator and is intended
    … …  
    8484    public void InsertionManipulatorApplyTest() {
    8585      TestRandom random = new TestRandom();
    86       Permutation.Permutation parent, expected;
     86      Permutation parent, expected;
    8787      // The following test is based on an example from Larranaga, P. et al. 1999. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13
    8888      random.Reset();
    8989      random.IntNumbers = new int[] { 3, 6 };
    90       parent = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     90      parent = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    9191      Assert.IsTrue(parent.Validate());
    9292     
    93       expected = new Permutation.Permutation(new int[] { 0, 1, 2, 4, 5, 6, 3, 7 });
     93      expected = new Permutation(new int[] { 0, 1, 2, 4, 5, 6, 3, 7 });
    9494      Assert.IsTrue(expected.Validate());
    9595      InsertionManipulator.Apply(random, parent);

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

    r2930 r3053  
    2121
    2222using Microsoft.VisualStudio.TestTools.UnitTesting;
    23 using HeuristicLab.Encodings.Permutation;
     23using HeuristicLab.Encodings.PermutationEncoding;
    2424
    25 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     25namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2626  /// <summary>
    2727  ///This is a test class for InversionManipulator and is intended
    … …  
    8484    public void InversionManipulatorApplyTest() {
    8585      TestRandom random = new TestRandom();
    86       Permutation.Permutation parent, expected;
     86      Permutation parent, expected;
    8787      // The following test is based on an example from Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg, pp. 46-47
    8888      random.Reset();
    8989      random.IntNumbers = new int[] { 1, 4 };
    90       parent = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
     90      parent = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
    9191      Assert.IsTrue(parent.Validate());
    9292     
    93       expected = new Permutation.Permutation(new int[] { 0, 4, 3, 2, 1, 5, 6, 7, 8 });
     93      expected = new Permutation(new int[] { 0, 4, 3, 2, 1, 5, 6, 7, 8 });
    9494      Assert.IsTrue(expected.Validate());
    9595      InversionManipulator.Apply(random, parent);

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/MaximalPreservativeCrossoverTest.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 MaximalPreservativeCrossover and is intended
    … …  
    9292      bool exceptionFired = false;
    9393      try {
    94         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    95           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     94        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     95          new Permutation(4), new Permutation(4), new Permutation(4)}));
    9696      }
    9797      catch (System.InvalidOperationException) {
    … …  
    107107    public void MaximalPreservativeCrossoverApplyTest() {
    108108      TestRandom random = new TestRandom();
    109       Permutation.Permutation parent1, parent2, expected, actual;
     109      Permutation parent1, parent2, expected, actual;
    110110      // The following test is based on an example from Larranaga, 1999. Genetic Algorithms for the Traveling Salesman Problem.
    111111      random.Reset();
    112112      random.IntNumbers = new int[] { 3, 2 };
    113       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     113      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    114114      Assert.IsTrue(parent1.Validate());
    115       parent2 = new Permutation.Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
     115      parent2 = new Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
    116116      Assert.IsTrue(parent2.Validate());
    117       expected = new Permutation.Permutation(new int[] { 1, 0, 2, 3, 4, 5, 7, 6 });
     117      expected = new Permutation(new int[] { 1, 0, 2, 3, 4, 5, 7, 6 });
    118118      Assert.IsTrue(expected.Validate());
    119119      actual = MaximalPreservativeCrossover.Apply(random, parent1, parent2);
    … …  
    125125      bool exceptionFired = false;
    126126      try {
    127         MaximalPreservativeCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     127        MaximalPreservativeCrossover.Apply(random, new Permutation(8), new Permutation(6));
    128128      }
    129129      catch (System.ArgumentException) {

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/OrderBasedCrossoverTest.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 OrderBasedCrossoverTest and is intended
    … …  
    9292      bool exceptionFired = false;
    9393      try {
    94         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    95           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     94        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     95          new Permutation(4), new Permutation(4), new Permutation(4)}));
    9696      } catch (System.InvalidOperationException) {
    9797        exceptionFired = true;
    … …  
    106106    public void OrderBasedCrossoverApplyTest() {
    107107      TestRandom random = new TestRandom();
    108       Permutation.Permutation parent1, parent2, expected, actual;
     108      Permutation parent1, parent2, expected, actual;
    109109      // The following test is based on an example from Larranaga, P. et al. 1999. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13
    110110      random.Reset();
    111111      random.IntNumbers = new int[] { 3, 5, 2, 1 };
    112       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     112      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    113113      Assert.IsTrue(parent1.Validate());
    114       parent2 = new Permutation.Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
     114      parent2 = new Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
    115115      Assert.IsTrue(parent2.Validate());
    116       expected = new Permutation.Permutation(new int[] { 1, 3, 2, 7, 6, 4, 5, 0 });
     116      expected = new Permutation(new int[] { 1, 3, 2, 7, 6, 4, 5, 0 });
    117117      actual = OrderBasedCrossover.Apply(random, parent1, parent2);
    118118      Assert.IsTrue(actual.Validate());
    … …  
    122122      bool exceptionFired = false;
    123123      try {
    124         OrderBasedCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     124        OrderBasedCrossover.Apply(random, new Permutation(8), new Permutation(6));
    125125      } catch (System.ArgumentException) {
    126126        exceptionFired = true;

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

    r2930 r3053  
    11using HeuristicLab.Core;
    22using Microsoft.VisualStudio.TestTools.UnitTesting;
    3 using HeuristicLab.Encodings.Permutation;
     3using HeuristicLab.Encodings.PermutationEncoding;
    44
    5 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     5namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    66    /// <summary>
    77    ///This is a test class for OrderCrossover2Test and is intended
    … …  
    6969      bool exceptionFired = false;
    7070      try {
    71         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    72           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     71        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     72          new Permutation(4), new Permutation(4), new Permutation(4)}));
    7373      } catch (System.InvalidOperationException) {
    7474        exceptionFired = true;
    … …  
    8383    public void OrderCrossover2ApplyTest() {
    8484      TestRandom random = new TestRandom();
    85       Permutation.Permutation parent1, parent2, expected, actual;
     85      Permutation parent1, parent2, expected, actual;
    8686      // The following test is based on an example from Affenzeller, M. et al. 2009. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications. CRC Press. p. 135.
    8787      random.Reset();
    8888      random.IntNumbers = new int[] { 5, 7 };
    89       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
     89      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
    9090      Assert.IsTrue(parent1.Validate());
    91       parent2 = new Permutation.Permutation(new int[] { 2, 5, 6, 0, 9, 1, 3, 8, 4, 7 });
     91      parent2 = new Permutation(new int[] { 2, 5, 6, 0, 9, 1, 3, 8, 4, 7 });
    9292      Assert.IsTrue(parent2.Validate());
    93       expected = new Permutation.Permutation(new int[] { 2, 0, 9, 1, 3, 5, 6, 7, 8, 4 });
     93      expected = new Permutation(new int[] { 2, 0, 9, 1, 3, 5, 6, 7, 8, 4 });
    9494      Assert.IsTrue(expected.Validate());
    9595      actual = OrderCrossover2.Apply(random, parent1, parent2);
    … …  
    101101      bool exceptionFired = false;
    102102      try {
    103         OrderCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     103        OrderCrossover.Apply(random, new Permutation(8), new Permutation(6));
    104104      } catch (System.ArgumentException) {
    105105        exceptionFired = true;

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/OrderCrossoverTest.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 OrderCrossoverTest and is intended
    … …  
    9292      bool exceptionFired = false;
    9393      try {
    94         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    95           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     94        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     95          new Permutation(4), new Permutation(4), new Permutation(4)}));
    9696      } catch (System.InvalidOperationException) {
    9797        exceptionFired = true;
    … …  
    106106    public void OrderCrossoverApplyTest() {
    107107      TestRandom random = new TestRandom();
    108       Permutation.Permutation parent1, parent2, expected, actual;
     108      Permutation parent1, parent2, expected, actual;
    109109      // The following test is based on an example from Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg, pp. 55-56
    110110      random.Reset();
    111111      random.IntNumbers = new int[] { 3, 6 };
    112       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
     112      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
    113113      Assert.IsTrue(parent1.Validate());
    114       parent2 = new Permutation.Permutation(new int[] { 8, 2, 6, 7, 1, 5, 4, 0, 3 });
     114      parent2 = new Permutation(new int[] { 8, 2, 6, 7, 1, 5, 4, 0, 3 });
    115115      Assert.IsTrue(parent2.Validate());
    116       expected = new Permutation.Permutation(new int[] { 2, 7, 1, 3, 4, 5, 6, 0, 8 });
     116      expected = new Permutation(new int[] { 2, 7, 1, 3, 4, 5, 6, 0, 8 });
    117117      Assert.IsTrue(expected.Validate());
    118118      actual = OrderCrossover.Apply(random, parent1, parent2);
    … …  
    122122      random.Reset();
    123123      random.IntNumbers = new int[] { 2, 4 };
    124       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     124      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    125125      Assert.IsTrue(parent1.Validate());
    126       parent2 = new Permutation.Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
     126      parent2 = new Permutation(new int[] { 1, 3, 5, 7, 6, 4, 2, 0 });
    127127      Assert.IsTrue(parent2.Validate());
    128       expected = new Permutation.Permutation(new int[] { 7, 6, 2, 3, 4, 0, 1, 5 });
     128      expected = new Permutation(new int[] { 7, 6, 2, 3, 4, 0, 1, 5 });
    129129      actual = OrderCrossover.Apply(random, parent1, parent2);
    130130      Assert.IsTrue(actual.Validate());
    … …  
    133133      random.Reset();
    134134      random.IntNumbers = new int[] { 2, 5 };
    135       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
     135      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
    136136      Assert.IsTrue(parent1.Validate());
    137       parent2 = new Permutation.Permutation(new int[] { 7, 3, 0, 4, 8, 2, 5, 1, 6 });
     137      parent2 = new Permutation(new int[] { 7, 3, 0, 4, 8, 2, 5, 1, 6 });
    138138      Assert.IsTrue(parent2.Validate());
    139       expected = new Permutation.Permutation(new int[] { 0, 8, 2, 3, 4, 5, 1, 6, 7 });
     139      expected = new Permutation(new int[] { 0, 8, 2, 3, 4, 5, 1, 6, 7 });
    140140      Assert.IsTrue(expected.Validate());
    141141      actual = OrderCrossover.Apply(random, parent1, parent2);
    … …  
    145145      random.Reset();
    146146      random.IntNumbers = new int[] { 0, 5 };
    147       parent1 = new Permutation.Permutation(new int[] { 2, 1, 4, 3, 7, 8, 6, 0, 5, 9 });
     147      parent1 = new Permutation(new int[] { 2, 1, 4, 3, 7, 8, 6, 0, 5, 9 });
    148148      Assert.IsTrue(parent1.Validate());
    149       parent2 = new Permutation.Permutation(new int[] { 5, 3, 4, 0, 9, 8, 2, 7, 1, 6 });
     149      parent2 = new Permutation(new int[] { 5, 3, 4, 0, 9, 8, 2, 7, 1, 6 });
    150150      Assert.IsTrue(parent2.Validate());
    151       expected = new Permutation.Permutation(new int[] { 2, 1, 4, 3, 7, 8, 6, 5, 0, 9 });
     151      expected = new Permutation(new int[] { 2, 1, 4, 3, 7, 8, 6, 5, 0, 9 });
    152152      Assert.IsTrue(expected.Validate());
    153153      actual = OrderCrossover.Apply(random, parent1, parent2);
    … …  
    157157      random.Reset();
    158158      random.IntNumbers = new int[] { 6, 9 };
    159       expected = new Permutation.Permutation(new int[] { 3, 4, 8, 2, 7, 1, 6, 0, 5, 9 });
     159      expected = new Permutation(new int[] { 3, 4, 8, 2, 7, 1, 6, 0, 5, 9 });
    160160      Assert.IsTrue(expected.Validate());
    161161      actual = OrderCrossover.Apply(random, parent1, parent2);
    … …  
    165165      random.Reset();
    166166      random.IntNumbers = new int[] { 0, 9 };
    167       expected = new Permutation.Permutation(new int[] { 2, 1, 4, 3, 7, 8, 6, 0, 5, 9 });
     167      expected = new Permutation(new int[] { 2, 1, 4, 3, 7, 8, 6, 0, 5, 9 });
    168168      Assert.IsTrue(expected.Validate());
    169169      actual = OrderCrossover.Apply(random, parent1, parent2);
    … …  
    175175      bool exceptionFired = false;
    176176      try {
    177         OrderCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     177        OrderCrossover.Apply(random, new Permutation(8), new Permutation(6));
    178178      } catch (System.ArgumentException) {
    179179        exceptionFired = true;

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/PartiallyMatchedCrossoverTest.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 PartiallyMatchedCrossover and is intended
    … …  
    9292      bool exceptionFired = false;
    9393      try {
    94         target.Cross(random, new ItemArray<Permutation.Permutation>(new Permutation.Permutation[] {
    95           new Permutation.Permutation(4), new Permutation.Permutation(4), new Permutation.Permutation(4)}));
     94        target.Cross(random, new ItemArray<Permutation>(new Permutation[] {
     95          new Permutation(4), new Permutation(4), new Permutation(4)}));
    9696      }
    9797      catch (System.InvalidOperationException) {
    … …  
    107107    public void PartiallyMatchedCrossoverApplyTest() {
    108108      TestRandom random = new TestRandom();
    109       Permutation.Permutation parent1, parent2, expected, actual;
     109      Permutation parent1, parent2, expected, actual;
    110110      // The following test is based on an example from Larranaga, 1999. Genetic Algorithms for the Traveling Salesman Problem.
    111111      random.Reset();
    112112      random.IntNumbers = new int[] { 3, 5 };
    113       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     113      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    114114      Assert.IsTrue(parent1.Validate());
    115       parent2 = new Permutation.Permutation(new int[] { 2, 6, 4, 0, 5, 7, 1, 3 });
     115      parent2 = new Permutation(new int[] { 2, 6, 4, 0, 5, 7, 1, 3 });
    116116      Assert.IsTrue(parent2.Validate());
    117       expected = new Permutation.Permutation(new int[] { 2, 6, 7, 3, 4, 5, 1, 0 });
     117      expected = new Permutation(new int[] { 2, 6, 7, 3, 4, 5, 1, 0 });
    118118      Assert.IsTrue(expected.Validate());
    119119      actual = PartiallyMatchedCrossover.Apply(random, parent1, parent2);
    … …  
    123123      random.Reset();
    124124      random.IntNumbers = new int[] { 5, 7 };
    125       parent1 = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
     125      parent1 = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
    126126      Assert.IsTrue(parent1.Validate());
    127       parent2 = new Permutation.Permutation(new int[] { 2, 5, 6, 0, 9, 1, 3, 8, 4, 7 });
     127      parent2 = new Permutation(new int[] { 2, 5, 6, 0, 9, 1, 3, 8, 4, 7 });
    128128      Assert.IsTrue(parent2.Validate());
    129       expected = new Permutation.Permutation(new int[] { 2, 1, 3, 0, 9, 5, 6, 7, 4, 8 });
     129      expected = new Permutation(new int[] { 2, 1, 3, 0, 9, 5, 6, 7, 4, 8 });
    130130      Assert.IsTrue(expected.Validate());
    131131      actual = PartiallyMatchedCrossover.Apply(random, parent1, parent2);
    … …  
    137137      bool exceptionFired = false;
    138138      try {
    139         PartiallyMatchedCrossover.Apply(random, new Permutation.Permutation(8), new Permutation.Permutation(6));
     139        PartiallyMatchedCrossover.Apply(random, new Permutation(8), new Permutation(6));
    140140      }
    141141      catch (System.ArgumentException) {

  • 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;

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/Properties/AssemblyInfo.cs

    r2906 r3053  
    55// set of attributes. Change these attribute values to modify the information
    66// associated with an assembly.
    7 [assembly: AssemblyTitle("HeuristicLab.Encodings.Permutation-3.3.Tests")]
     7[assembly: AssemblyTitle("HeuristicLab.Encodings.PermutationEncoding-3.3.Tests")]
    88[assembly: AssemblyDescription("Unit tests for the HeuristicLab permutation encoding and related operators.")]
    99[assembly: AssemblyConfiguration("")]

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

    r2932 r3053  
    2323using HeuristicLab.Core;
    2424
    25 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     25namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2626  public class TestRandom : IRandom {
    2727    #region Variables and Properties

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

    r2930 r3053  
    2121
    2222using Microsoft.VisualStudio.TestTools.UnitTesting;
    23 using HeuristicLab.Encodings.Permutation;
     23using HeuristicLab.Encodings.PermutationEncoding;
    2424
    25 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     25namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2626  /// <summary>
    2727  ///This is a test class for ScrambleManipulator and is intended
    … …  
    8484    public void ScrambleManipulatorApplyTest() {
    8585      TestRandom random = new TestRandom();
    86       Permutation.Permutation parent, expected;
     86      Permutation parent, expected;
    8787      // The following test is based on an example from Larranaga, P. et al. 1999. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13
    8888      random.Reset();
    8989      random.IntNumbers = new int[] { 3, 6, 1, 1, 1, 0 };
    90       parent = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     90      parent = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    9191      Assert.IsTrue(parent.Validate());
    9292     
    93       expected = new Permutation.Permutation(new int[] { 0, 1, 2, 4, 5, 6, 3, 7 });
     93      expected = new Permutation(new int[] { 0, 1, 2, 4, 5, 6, 3, 7 });
    9494      Assert.IsTrue(expected.Validate());
    9595      ScrambleManipulator.Apply(random, parent);

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

    r2930 r3053  
    2121
    2222using Microsoft.VisualStudio.TestTools.UnitTesting;
    23 using HeuristicLab.Encodings.Permutation;
     23using HeuristicLab.Encodings.PermutationEncoding;
    2424
    25 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     25namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2626  /// <summary>
    2727  ///This is a test class for Swap2Manipulator and is intended
    … …  
    8484    public void Swap2ManipulatorApplyTest() {
    8585      TestRandom random = new TestRandom();
    86       Permutation.Permutation parent, expected;
     86      Permutation parent, expected;
    8787      // The following test is based on an example from Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg, p. 45
    8888      random.Reset();
    8989      random.IntNumbers = new int[] { 1, 4 };
    90       parent = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
     90      parent = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
    9191      Assert.IsTrue(parent.Validate());
    9292
    93       expected = new Permutation.Permutation(new int[] { 0, 4, 2, 3, 1, 5, 6, 7, 8 });
     93      expected = new Permutation(new int[] { 0, 4, 2, 3, 1, 5, 6, 7, 8 });
    9494      Assert.IsTrue(expected.Validate());
    9595      Swap2Manipulator.Apply(random, parent);

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

    r2930 r3053  
    2121
    2222using Microsoft.VisualStudio.TestTools.UnitTesting;
    23 using HeuristicLab.Encodings.Permutation;
     23using HeuristicLab.Encodings.PermutationEncoding;
    2424
    25 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     25namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2626  /// <summary>
    2727  ///This is a test class for Swap3Manipulator and is intended
    … …  
    8484    public void Swap3ManipulatorApplyTest() {
    8585      TestRandom random = new TestRandom();
    86       Permutation.Permutation parent, expected;
     86      Permutation parent, expected;
    8787      // Test manipulator
    8888      random.Reset();
    8989      random.IntNumbers = new int[] { 1, 3, 6 };
    9090      random.DoubleNumbers = new double[] { 0 };
    91       parent = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
     91      parent = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 });
    9292      Assert.IsTrue(parent.Validate());
    9393
    94       expected = new Permutation.Permutation(new int[] { 0, 3, 2, 6, 4, 5, 1, 7, 8 });
     94      expected = new Permutation(new int[] { 0, 3, 2, 6, 4, 5, 1, 7, 8 });
    9595      Assert.IsTrue(expected.Validate());
    9696      Swap3Manipulator.Apply(random, parent);

  • trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Tests/Test References/HeuristicLab.Encodings.Permutation-3.3.accessor

    r2930 r3053  
    1 HeuristicLab.Encodings.Permutation-3.3.dll
     1HeuristicLab.Encodings.PermutationEncoding-3.3.dll
    22Desktop

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

    r2930 r3053  
    2121
    2222using Microsoft.VisualStudio.TestTools.UnitTesting;
    23 using HeuristicLab.Encodings.Permutation;
     23using HeuristicLab.Encodings.PermutationEncoding;
    2424
    25 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     25namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2626  /// <summary>
    2727  ///This is a test class for TranslocationInversionManipulator and is intended
    … …  
    8484    public void TranslocationInversionManipulatorApplyTest() {
    8585      TestRandom random = new TestRandom();
    86       Permutation.Permutation parent, expected;
     86      Permutation parent, expected;
    8787      // The following test is based on an example from Larranaga, P. et al. 1999. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13
    8888      random.Reset();
    8989      random.IntNumbers = new int[] { 2, 4, 4 };
    90       parent = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     90      parent = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    9191      Assert.IsTrue(parent.Validate());
    9292     
    93       expected = new Permutation.Permutation(new int[] { 0, 1, 5, 6, 4, 3, 2, 7 });
     93      expected = new Permutation(new int[] { 0, 1, 5, 6, 4, 3, 2, 7 });
    9494      Assert.IsTrue(expected.Validate());
    9595      TranslocationInversionManipulator.Apply(random, parent);

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

    r2930 r3053  
    2121
    2222using Microsoft.VisualStudio.TestTools.UnitTesting;
    23 using HeuristicLab.Encodings.Permutation;
     23using HeuristicLab.Encodings.PermutationEncoding;
    2424
    25 namespace HeuristicLab.Encodings.Permutation_33.Tests {
     25namespace HeuristicLab.Encodings.PermutationEncoding_33.Tests {
    2626  /// <summary>
    2727  ///This is a test class for TranslocationManipulator and is intended
    … …  
    8484    public void TranslocationManipulatorApplyTest() {
    8585      TestRandom random = new TestRandom();
    86       Permutation.Permutation parent, expected;
     86      Permutation parent, expected;
    8787      // The following test is based on an example from Larranaga, P. et al. 1999. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13, p. 24
    8888      random.Reset();
    8989      random.IntNumbers = new int[] { 2, 4, 4 };
    90       parent = new Permutation.Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
     90      parent = new Permutation(new int[] { 0, 1, 2, 3, 4, 5, 6, 7 });
    9191      Assert.IsTrue(parent.Validate());
    9292     
    93       expected = new Permutation.Permutation(new int[] { 0, 1, 5, 6, 2, 3, 4, 7 });
     93      expected = new Permutation(new int[] { 0, 1, 5, 6, 2, 3, 4, 7 });
    9494      Assert.IsTrue(expected.Validate());
    9595      TranslocationManipulator.Apply(random, parent);
Note: See TracChangeset for help on using the changeset viewer.