Changeset 13404 for branches/ProblemRefactoring/HeuristicLab.Optimization/3.3/BasicProblems/Interfaces

Timestamp:

11/26/15 09:30:43 (9 years ago)

Author:

abeham

Message:

#2521:

• Adapted Knapsack problem to new problem infrastructure
• Introduced additional interfaces in binary vector encoding
• Improved KnapsackImprovementOperator which requires less evaluated solutions in case of an infeasible start solution

Loosely related change:

• All LookupParameters are now shown by default
• Wiring code should make sure that wired parameters are hidden

File:

• branches/ProblemRefactoring/HeuristicLab.Optimization/3.3/BasicProblems/Interfaces/ISingleObjectiveProblemDefinition.cs (modified) (1 diff)

branches/ProblemRefactoring/HeuristicLab.Optimization/3.3/BasicProblems/Interfaces/ISingleObjectiveProblemDefinition.cs

@@ -28 +28 @@
     where TSolution : class, ISolution {
     bool Maximization { get; }
-    double Evaluate(TSolution individual, IRandom random);
-    void Analyze(TSolution[] individuals, double[] qualities, ResultCollection results, IRandom random);
-    IEnumerable<TSolution> GetNeighbors(TSolution individual, IRandom random);
+    double Evaluate(TSolution solution, IRandom random);
+    void Analyze(TSolution[] solutions, double[] qualities, ResultCollection results, IRandom random);
+    IEnumerable<TSolution> GetNeighbors(TSolution solution, IRandom random);
     bool IsBetter(double quality, double bestQuality);
   }