Changeset 13408 for branches/ProblemRefactoring

Timestamp:

11/26/15 17:36:54 (9 years ago)

Author:

mkommend

Message:

#2521: Adapted unit tests in problem refactoring branch.

Location:

branches/ProblemRefactoring/HeuristicLab.Tests

Files:

• HeuristicLab-3.3/Samples/EsGriewankSampleTest.cs (modified) (1 diff)
• HeuristicLab-3.3/Samples/LocalSearchKnapsackSampleTest.cs (modified) (1 diff)
• HeuristicLab-3.3/Samples/OSESGriewankSampleTest.cs (modified) (2 diffs)
• HeuristicLab-3.3/Samples/PsoSchwefelSampleTest.cs (modified) (1 diff)
• HeuristicLab-3.3/Samples/SimulatedAnnealingRastriginSampleTest.cs (modified) (2 diffs)
• HeuristicLab.Problems.QuadraticAssignment-3.3/QAPLIBInstancesTest.cs (modified) (1 diff)
• HeuristicLab.Problems.QuadraticAssignment-3.3/QAPMoveEvaluatorTest.cs (modified) (11 diffs)
• HeuristicLab.Problems.TestFunctions-3.3/AckleyEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/BealeEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/BoothEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/GriewankEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/LevyEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/MatyasEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/RastriginEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/RosenbrockEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/SphereEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/SumSquaresEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Problems.TestFunctions-3.3/ZakharovEvaluatorTest.cs (modified) (1 diff)
• HeuristicLab.Scripting-3.3/Script Sources/GAQAPScriptSource.cs (modified) (2 diffs)
• HeuristicLab.Tests.csproj (modified) (5 diffs)

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab-3.3/Samples/EsGriewankSampleTest.cs

@@ -62 +62 @@
       SingleObjectiveTestFunctionProblem problem = new SingleObjectiveTestFunctionProblem();
 
-      problem.ProblemSize.Value = 10;
-      problem.EvaluatorParameter.Value = new GriewankEvaluator();
+      problem.ProblemSize = 10;
+      problem.TestFunction = new Griewank();
       problem.SolutionCreatorParameter.Value = new UniformRandomRealVectorCreator();
-      problem.Maximization.Value = false;
       problem.Bounds = new DoubleMatrix(new double[,] { { -600, 600 } });
-      problem.BestKnownQuality.Value = 0;
+      problem.BestKnownQuality = 0;
       problem.BestKnownSolutionParameter.Value = new RealVector(10);
       problem.Name = "Single Objective Test Function";

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab-3.3/Samples/LocalSearchKnapsackSampleTest.cs

@@ -59 +59 @@
       #region Problem Configuration
       KnapsackProblem problem = new KnapsackProblem();
-      problem.BestKnownQuality = new DoubleValue(362);
+      problem.BestKnownQuality = 362;
       problem.BestKnownSolution = new HeuristicLab.Encodings.BinaryVectorEncoding.BinaryVector(new bool[] { 
        true , false, false, true , true , true , true , true , false, true , true , true , true , true , true , false, true , false, true , true , false, true , true , false, true , false, true , true , true , false, true , true , false, true , true , false, true , false, true , true , true , true , true , true , true , true , true , true , true , true , true , false, true , false, false, true , true , false, true , true , true , true , true , true , true , true , false, true , false, true , true , true , true , false, true , true , true , true , true , true , true , true});
-      problem.EvaluatorParameter.Value = new KnapsackEvaluator();
       problem.SolutionCreatorParameter.Value = new RandomBinaryVectorCreator();
-      problem.KnapsackCapacity.Value = 297;
-      problem.Maximization.Value = true;
-      problem.Penalty.Value = 1;
+      problem.KnapsackCapacity = 297;
       problem.Values = new IntArray(new int[] { 
   6, 1, 1, 6, 7, 8, 7, 4, 2, 5, 2, 6, 7, 8, 7, 1, 7, 1, 9, 4, 2, 6, 5,  3, 5, 3, 3, 6, 5, 2, 4, 9, 4, 5, 7, 1, 4, 3, 5, 5, 8, 3, 6, 7, 3, 9, 7, 7, 5, 5, 7, 1, 4, 4, 3, 9, 5, 1, 6, 2, 2, 6, 1, 6, 5, 4, 4, 7, 1,  8, 9, 9, 7, 4, 3, 8, 7, 5, 7, 4, 4, 5});

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab-3.3/Samples/OSESGriewankSampleTest.cs

@@ -21 +21 @@
 
 using System.IO;
-using HeuristicLab.Algorithms.EvolutionStrategy;
 using HeuristicLab.Algorithms.OffspringSelectionEvolutionStrategy;
 using HeuristicLab.Data;
@@ -63 +62 @@
       SingleObjectiveTestFunctionProblem problem = new SingleObjectiveTestFunctionProblem();
 
-      problem.ProblemSize.Value = 10;
-      problem.EvaluatorParameter.Value = new GriewankEvaluator();
+      problem.ProblemSize = 10;
+      problem.TestFunction = new Griewank();
       problem.SolutionCreatorParameter.Value = new UniformRandomRealVectorCreator();
-      problem.Maximization.Value = false;
       problem.Bounds = new DoubleMatrix(new double[,] { { -600, 600 } });
-      problem.BestKnownQuality.Value = 0;
+      problem.BestKnownQuality = 0;
       problem.BestKnownSolutionParameter.Value = new RealVector(10);
       problem.Name = "Single Objective Test Function";

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab-3.3/Samples/PsoSchwefelSampleTest.cs

@@ -68 +68 @@
       #region Problem Configuration
       var problem = new SingleObjectiveTestFunctionProblem();
-      problem.BestKnownQuality.Value = 0.0;
+      problem.BestKnownQuality = 0.0;
       problem.BestKnownSolutionParameter.Value = new RealVector(new double[] { 420.968746, 420.968746 });
       problem.Bounds = new DoubleMatrix(new double[,] { { -500, 500 } });
-      problem.EvaluatorParameter.Value = new SchwefelEvaluator();
-      problem.Maximization.Value = false;
-      problem.ProblemSize.Value = 2;
+      problem.TestFunction = new Schwefel();
+      problem.ProblemSize = 2;
       problem.SolutionCreatorParameter.Value = new UniformRandomRealVectorCreator();
       #endregion

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab-3.3/Samples/SimulatedAnnealingRastriginSampleTest.cs

@@ -57 +57 @@
       #region Problem Configuration
       var problem = new SingleObjectiveTestFunctionProblem();
-      problem.BestKnownQuality.Value = 0.0;
+      problem.BestKnownQuality = 0.0;
       problem.BestKnownSolutionParameter.Value = new RealVector(new double[] { 0, 0 });
       problem.Bounds = new DoubleMatrix(new double[,] { { -5.12, 5.12 } });
-      problem.EvaluatorParameter.Value = new RastriginEvaluator();
-      problem.Maximization.Value = false;
-      problem.ProblemSize.Value = 2;
+      problem.TestFunction= new Rastrigin();
+      problem.ProblemSize = 2;
       problem.SolutionCreatorParameter.Value = new UniformRandomRealVectorCreator();
       #endregion
@@ -79 +78 @@
       sa.MaximumIterations.Value = 100;
       var moveEvaluator = sa.MoveEvaluatorParameter.ValidValues
-        .OfType<RastriginAdditiveMoveEvaluator>()
+        .OfType<AdditiveMoveEvaluator>()
         .Single();
-      moveEvaluator.A.Value = 10;
       sa.MoveEvaluator = moveEvaluator;
 

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.QuadraticAssignment-3.3/QAPLIBInstancesTest.cs

@@ -223 +223 @@
         qap.Load(provider.LoadData(instance));
         if (qaplibInstances.ContainsKey(instance.Name)
-          && qap.BestKnownQuality != null && qap.BestKnownQuality.Value != qaplibInstances[instance.Name])
-          failedInstances.AppendLine(instance.Name + ": " + qap.BestKnownQuality.Value.ToString() + " vs " + qaplibInstances[instance.Name]);
+          && qap.BestKnownQuality != null && qap.BestKnownQuality != qaplibInstances[instance.Name])
+          failedInstances.AppendLine(instance.Name + ": " + qap.BestKnownQuality.ToString() + " vs " + qaplibInstances[instance.Name]);
       }
       Assert.IsTrue(failedInstances.Length == 0, "Following instances/solutions have suspicious best quality: " + Environment.NewLine + failedInstances.ToString());

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.QuadraticAssignment-3.3/QAPMoveEvaluatorTest.cs

@@ -35 +35 @@
     private const int ProblemSize = 10;
     private static DoubleMatrix symmetricDistances, symmetricWeights, asymmetricDistances, asymmetricWeights, nonZeroDiagonalWeights, nonZeroDiagonalDistances;
+
+    private static QuadraticAssignmentProblem symmetricProblem, asymmetricProblem, nonZeroDiagonalProblem;
     private static Permutation assignment;
     private static MersenneTwister random;
@@ -82 +84 @@
         nonZeroDiagonalWeights[index, index] = random.Next(1, ProblemSize * 100);
       assignment = new Permutation(PermutationTypes.Absolute, ProblemSize, random);
+
+      symmetricProblem = new QuadraticAssignmentProblem();
+      symmetricProblem.Distances = symmetricDistances;
+      symmetricProblem.Weights = symmetricWeights;
+
+      asymmetricProblem = new QuadraticAssignmentProblem();
+      asymmetricProblem.Distances = asymmetricDistances;
+      asymmetricProblem.Weights = asymmetricWeights;
+
+      nonZeroDiagonalProblem = new QuadraticAssignmentProblem();
+      nonZeroDiagonalProblem.Distances = nonZeroDiagonalDistances;
+      nonZeroDiagonalProblem.Weights = nonZeroDiagonalWeights;
     }
 
@@ -88 +102 @@
     [TestProperty("Time", "short")]
     public void Swap2MoveEvaluatorFastEvaluationTest() {
-
       for (int i = 0; i < 500; i++) {
         Swap2Move lastMove = new Swap2Move(random.Next(ProblemSize), random.Next(ProblemSize));
@@ -100 +113 @@
         double moveAfter = QAPSwap2MoveEvaluator.Apply(assignment, currentMove,
                 moveBefore, symmetricWeights, symmetricDistances, lastMove);
-        double before = QAPEvaluator.Apply(assignment, symmetricWeights, symmetricDistances);
-        double after = QAPEvaluator.Apply(nextAssignment, symmetricWeights, symmetricDistances);
+        double before = symmetricProblem.Evaluate(assignment);
+        double after = symmetricProblem.Evaluate(nextAssignment);
 
         Assert.IsTrue(moveAfter.IsAlmost(after - before), "Failed on symmetric matrices: " + Environment.NewLine
@@ -109 +122 @@
         moveAfter = QAPSwap2MoveEvaluator.Apply(assignment, currentMove,
                 moveBefore, asymmetricWeights, asymmetricDistances, lastMove);
-        before = QAPEvaluator.Apply(assignment, asymmetricWeights, asymmetricDistances);
-        after = QAPEvaluator.Apply(nextAssignment, asymmetricWeights, asymmetricDistances);
+        before = asymmetricProblem.Evaluate(assignment);
+        after = asymmetricProblem.Evaluate(nextAssignment);
 
         Assert.IsTrue(moveAfter.IsAlmost(after - before), "Failed on asymmetric matrices: " + Environment.NewLine
@@ -118 +131 @@
         moveAfter = QAPSwap2MoveEvaluator.Apply(assignment, currentMove,
                 moveBefore, nonZeroDiagonalWeights, nonZeroDiagonalDistances, lastMove);
-        before = QAPEvaluator.Apply(assignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
-        after = QAPEvaluator.Apply(nextAssignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
+        before = nonZeroDiagonalProblem.Evaluate(assignment);
+        after = nonZeroDiagonalProblem.Evaluate(nextAssignment);
 
         Assert.IsTrue(moveAfter.IsAlmost(after - before), "Failed on non-zero diagonal matrices: " + Environment.NewLine
@@ -130 +143 @@
     [TestProperty("Time", "short")]
     public void Swap2MoveEvaluatorTest() {
+
       for (int i = 0; i < 500; i++) {
         int index1 = random.Next(ProblemSize);
@@ -135 +149 @@
 
         // SYMMETRIC MATRICES
-        double before = QAPEvaluator.Apply(assignment, symmetricWeights, symmetricDistances);
+        double before = symmetricProblem.Evaluate(assignment);
         Swap2Manipulator.Apply(assignment, index1, index2);
-        double after = QAPEvaluator.Apply(assignment, symmetricWeights, symmetricDistances);
+        double after = symmetricProblem.Evaluate(assignment);
         double move = QAPSwap2MoveEvaluator.Apply(assignment, new Swap2Move(index1, index2, assignment), symmetricWeights, symmetricDistances);
         Assert.IsTrue(move.IsAlmost(before - after), "Failed on symmetric matrices");
 
         // ASYMMETRIC MATRICES
-        before = QAPEvaluator.Apply(assignment, asymmetricWeights, asymmetricDistances);
+        before = asymmetricProblem.Evaluate(assignment);
         Permutation clone = (Permutation)assignment.Clone();
         Swap2Manipulator.Apply(assignment, index1, index2);
-        after = QAPEvaluator.Apply(assignment, asymmetricWeights, asymmetricDistances);
+        after = asymmetricProblem.Evaluate(assignment);
         move = QAPSwap2MoveEvaluator.Apply(clone, new Swap2Move(index1, index2), asymmetricWeights, asymmetricDistances);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on asymmetric matrices");
 
         // NON-ZERO DIAGONAL ASSYMETRIC MATRICES
-        before = QAPEvaluator.Apply(assignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
+        before = nonZeroDiagonalProblem.Evaluate(assignment);
         clone = (Permutation)assignment.Clone();
         Swap2Manipulator.Apply(assignment, index1, index2);
-        after = QAPEvaluator.Apply(assignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
+        after = nonZeroDiagonalProblem.Evaluate(assignment);
         move = QAPSwap2MoveEvaluator.Apply(clone, new Swap2Move(index1, index2), nonZeroDiagonalWeights, nonZeroDiagonalDistances);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on non-zero diagonal matrices");
@@ -169 +183 @@
 
         // SYMMETRIC MATRICES
-        double before = QAPEvaluator.Apply(assignment, symmetricWeights, symmetricDistances);
+        double before = symmetricProblem.Evaluate(assignment);
         InversionManipulator.Apply(assignment, Math.Min(index1, index2), Math.Max(index1, index2));
-        double after = QAPEvaluator.Apply(assignment, symmetricWeights, symmetricDistances);
+        double after = symmetricProblem.Evaluate(assignment);
         double move = QAPInversionMoveEvaluator.Apply(assignment, new InversionMove(index1, index2, assignment), symmetricWeights, symmetricDistances);
         Assert.IsTrue(move.IsAlmost(before - after), "Failed on symmetric matrices");
 
         // ASYMMETRIC MATRICES
-        before = QAPEvaluator.Apply(assignment, asymmetricWeights, asymmetricDistances);
+        before = asymmetricProblem.Evaluate(assignment);
         Permutation clone = (Permutation)assignment.Clone();
         InversionManipulator.Apply(assignment, index1, index2);
-        after = QAPEvaluator.Apply(assignment, asymmetricWeights, asymmetricDistances);
+        after = asymmetricProblem.Evaluate(assignment);
         move = QAPInversionMoveEvaluator.Apply(clone, new InversionMove(index1, index2), asymmetricWeights, asymmetricDistances);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on asymmetric matrices");
 
         // NON-ZERO DIAGONAL ASYMMETRIC MATRICES
-        before = QAPEvaluator.Apply(assignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
+        before = nonZeroDiagonalProblem.Evaluate(assignment);
         clone = (Permutation)assignment.Clone();
         InversionManipulator.Apply(assignment, index1, index2);
-        after = QAPEvaluator.Apply(assignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
+        after = nonZeroDiagonalProblem.Evaluate(assignment);
         move = QAPInversionMoveEvaluator.Apply(clone, new InversionMove(index1, index2), nonZeroDiagonalWeights, nonZeroDiagonalDistances);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on non-zero diagonal matrices");
@@ -208 +222 @@
 
         // SYMMETRIC MATRICES
-        double before = QAPEvaluator.Apply(assignment, symmetricWeights, symmetricDistances);
+        double before = symmetricProblem.Evaluate(assignment);
         Permutation clone = new Cloner().Clone(assignment);
         TranslocationManipulator.Apply(assignment, index1, index2, insertPoint);
-        double after = QAPEvaluator.Apply(assignment, symmetricWeights, symmetricDistances);
+        double after = symmetricProblem.Evaluate(assignment);
         double move = QAPTranslocationMoveEvaluator.Apply(clone, new TranslocationMove(index1, index2, insertPoint, assignment), symmetricWeights, symmetricDistances);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on symmetric matrices");
 
         // ASYMMETRIC MATRICES
-        before = QAPEvaluator.Apply(assignment, asymmetricWeights, asymmetricDistances);
+        before = asymmetricProblem.Evaluate(assignment);
         clone = new Cloner().Clone(assignment);
         TranslocationManipulator.Apply(assignment, index1, index2, insertPoint);
-        after = QAPEvaluator.Apply(assignment, asymmetricWeights, asymmetricDistances);
+        after = asymmetricProblem.Evaluate(assignment);
         move = QAPTranslocationMoveEvaluator.Apply(clone, new TranslocationMove(index1, index2, insertPoint, assignment), asymmetricWeights, asymmetricDistances);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on asymmetric matrices");
 
         // NON-ZERO DIAGONAL ASYMMETRIC MATRICES
-        before = QAPEvaluator.Apply(assignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
+        before = nonZeroDiagonalProblem.Evaluate(assignment);
         clone = new Cloner().Clone(assignment);
         TranslocationManipulator.Apply(assignment, index1, index2, insertPoint);
-        after = QAPEvaluator.Apply(assignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
+        after = nonZeroDiagonalProblem.Evaluate(assignment);
         move = QAPTranslocationMoveEvaluator.Apply(clone, new TranslocationMove(index1, index2, insertPoint, assignment), nonZeroDiagonalWeights, nonZeroDiagonalDistances);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on non-zero diagonal matrices");
@@ -241 +255 @@
 
         // SYMMETRIC MATRICES
-        double before = QAPEvaluator.Apply(assignment, symmetricWeights, symmetricDistances);
+        double before = symmetricProblem.Evaluate(assignment);
         double move = QAPScrambleMoveEvaluator.Apply(assignment, scramble, symmetricWeights, symmetricDistances);
         ScrambleManipulator.Apply(assignment, scramble.StartIndex, scramble.ScrambledIndices);
-        double after = QAPEvaluator.Apply(assignment, symmetricWeights, symmetricDistances);
+        double after = symmetricProblem.Evaluate(assignment);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on symmetric matrices");
 
         // ASYMMETRIC MATRICES
-        before = QAPEvaluator.Apply(assignment, asymmetricWeights, asymmetricDistances);
+        before = asymmetricProblem.Evaluate(assignment);
         move = QAPScrambleMoveEvaluator.Apply(assignment, scramble, asymmetricWeights, asymmetricDistances);
         ScrambleManipulator.Apply(assignment, scramble.StartIndex, scramble.ScrambledIndices);
-        after = QAPEvaluator.Apply(assignment, asymmetricWeights, asymmetricDistances);
+        after = asymmetricProblem.Evaluate(assignment);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on asymmetric matrices");
 
         // NON-ZERO DIAGONAL ASYMMETRIC MATRICES
-        before = QAPEvaluator.Apply(assignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
+        before = nonZeroDiagonalProblem.Evaluate(assignment);
         move = QAPScrambleMoveEvaluator.Apply(assignment, scramble, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
         ScrambleManipulator.Apply(assignment, scramble.StartIndex, scramble.ScrambledIndices);
-        after = QAPEvaluator.Apply(assignment, nonZeroDiagonalWeights, nonZeroDiagonalDistances);
+        after = nonZeroDiagonalProblem.Evaluate(assignment);
         Assert.IsTrue(move.IsAlmost(after - before), "Failed on non-zero diagonal matrices");
       }

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/AckleyEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void AckleyEvaluateFunctionTest() {
-      AckleyEvaluator target = new AckleyEvaluator();
+      var target = new Ackley();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/BealeEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void BealeEvaluateFunctionTest() {
-      BealeEvaluator target = new BealeEvaluator();
+      var target = new Beale();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/BoothEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void BoothEvaluateFunctionTest() {
-      BoothEvaluator target = new BoothEvaluator();
+      var target = new Booth();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/GriewankEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void GriewankEvaluateFunctionTest() {
-      GriewankEvaluator target = new GriewankEvaluator();
+      var target = new Griewank();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/LevyEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void LevyEvaluateFunctionTest() {
-      LevyEvaluator target = new LevyEvaluator();
+      var target = new Levy();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/MatyasEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void MatyasEvaluateFunctionTest() {
-      MatyasEvaluator target = new MatyasEvaluator();
+      var target = new Matyas();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/RastriginEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void RastriginEvaluateFunctionTest() {
-      RastriginEvaluator target = new RastriginEvaluator();
+      var target = new Rastrigin();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/RosenbrockEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void RosenbrockEvaluateFunctionTest() {
-      RosenbrockEvaluator target = new RosenbrockEvaluator();
+      var target = new Rosenbrock();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/SphereEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void SphereEvaluateFunctionTest() {
-      SphereEvaluator target = new SphereEvaluator();
+      var target = new Sphere();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/SumSquaresEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void SumSquaresEvaluateFunctionTest() {
-      SumSquaresEvaluator target = new SumSquaresEvaluator();
+      var target = new SumSquares();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Problems.TestFunctions-3.3/ZakharovEvaluatorTest.cs

@@ -37 +37 @@
     [TestProperty("Time", "short")]
     public void ZakharovEvaluateFunctionTest() {
-      ZakharovEvaluator target = new ZakharovEvaluator();
+      var target = new Zakharov();
       RealVector point = null;
       double expected = target.BestKnownQuality;

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Scripting-3.3/Script Sources/GAQAPScriptSource.cs

@@ -42 +42 @@
     for (int i = 0; i < popSize; i++) {
       population[i] = new Permutation(PermutationTypes.Absolute, qap.Weights.Rows, random);
-      qualities[i] = QAPEvaluator.Apply(population[i], qap.Weights, qap.Distances);
+      qualities[i] = qap.Evaluate(population[i]);
     }
     var bestQuality = qualities.Min();
@@ -52 +52 @@
         nextGen[i] = PartiallyMatchedCrossover.Apply(random, parents[i * 2], parents[i * 2 + 1]);
         if (random.NextDouble() < mutationRate) Swap2Manipulator.Apply(random, nextGen[i]);
-        nextQual[i] = QAPEvaluator.Apply(nextGen[i], qap.Weights, qap.Distances);
+        nextQual[i] = qap.Evaluate(nextGen[i]);
         if (nextQual[i] < bestQuality) {
           bestQuality = nextQual[i];

branches/ProblemRefactoring/HeuristicLab.Tests/HeuristicLab.Tests.csproj

@@ -440 +440 @@
     <Compile Include="HeuristicLab-3.3\PluginLoader.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\AlpsSampleTest.cs" />
+    <Compile Include="HeuristicLab-3.3\Samples\EsGriewankSampleTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
     <Compile Include="HeuristicLab-3.3\Samples\GPRobocodeSampleTest.cs" />
-    <Compile Include="HeuristicLab-3.3\Samples\OSESGriewankSampleTest.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\GAGroupingProblemSampleTest.cs" />
+    <Compile Include="HeuristicLab-3.3\Samples\LocalSearchKnapsackSampleTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab-3.3\Samples\OSESGriewankSampleTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab-3.3\Samples\PsoSchwefelSampleTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab-3.3\Samples\SimulatedAnnealingRastriginSampleTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
     <Compile Include="HeuristicLab-3.3\Samples\VnsOpSampleTest.cs" />
-    <Compile Include="HeuristicLab-3.3\Samples\EsGriewankSampleTest.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\GaussianProcessRegressionSampleTest.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\GAVrpSampleTest.cs" />
@@ -454 +467 @@
     <Compile Include="HeuristicLab-3.3\Samples\GPTimeSeriesSampleTest.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\GPMultiplexerSampleTest.cs" />
-    <Compile Include="HeuristicLab-3.3\Samples\LocalSearchKnapsackSampleTest.cs" />
-    <Compile Include="HeuristicLab-3.3\Samples\PsoSchwefelSampleTest.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\RAPGASchedulingSampleTest.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\SamplesUtils.cs" />
@@ -461 +472 @@
     <Compile Include="HeuristicLab-3.3\Samples\IslandGaTspSampleTest.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\ScatterSearchVRPSampleTest.cs" />
-    <Compile Include="HeuristicLab-3.3\Samples\SimulatedAnnealingRastriginSampleTest.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\TabuSearchTspSampleTest.cs" />
     <Compile Include="HeuristicLab-3.3\Samples\TabuSearchVRPSampleTest.cs" />
@@ -572 +582 @@
     <Compile Include="HeuristicLab.Problems.Instances-3.3\TSPLIBInstanceProviderTest.cs" />
     <Compile Include="HeuristicLab.Problems.Instances.DataAnalysis-3.3\ClassificationInstanceProviderTest.cs" />
-    <Compile Include="HeuristicLab.Problems.QuadraticAssignment-3.3\QAPLIBInstancesTest.cs" />
-    <Compile Include="HeuristicLab.Problems.QuadraticAssignment-3.3\QAPMoveEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\AckleyEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\BealeEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\BoothEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\GriewankEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\LevyEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\MatyasEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\RastriginEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\RosenbrockEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\SphereEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\SumSquaresEvaluatorTest.cs" />
-    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\ZakharovEvaluatorTest.cs" />
+    <Compile Include="HeuristicLab.Problems.QuadraticAssignment-3.3\QAPLIBInstancesTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.QuadraticAssignment-3.3\QAPMoveEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\AckleyEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\BealeEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\BoothEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\GriewankEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\LevyEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\MatyasEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\RastriginEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\RosenbrockEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\SphereEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\SumSquaresEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
+    <Compile Include="HeuristicLab.Problems.TestFunctions-3.3\ZakharovEvaluatorTest.cs">
+      <SubType>Code</SubType>
+    </Compile>
     <Compile Include="HeuristicLab.Problems.TravelingSalesman-3.3\TSPMoveEvaluatorTest.cs" />
     <Compile Include="HeuristicLab.Problems.LinearAssignment-3.3\LinearAssignmentProblemSolverTest.cs" />
@@ -660 +696 @@
     </EmbeddedResource>
   </ItemGroup>
+  <ItemGroup />
   <Import Project="$(MSBuildBinPath)\Microsoft.CSharp.targets" />
   <!-- To modify your build process, add your task inside one of the targets below and uncomment it.