WFG2(int k,
int l,
int M)
Constructs a WFG2 problem instance with the specified number of
position-related and distance-related variables and the specified number
of objectives.
Method Summary
void
evaluate(Solution solution)
Evaluates the solution, updating the solution's objectives in place.
Constructs a WFG2 problem instance with the specified number of
position-related and distance-related variables and the specified number
of objectives.
Parameters:
k - the number of position-related variables for this problem
l - the number of distance-related variables for this problem
Evaluates the solution, updating the solution's objectives in place.
Algorithms must explicitly call this method when appropriate to evaluate
new solutions or reevaluate modified solutions.
Returns a randomly-generated solution using the analytical solution to
this problem. Note however that discontinuous Pareto surfaces may result
in some solutions generated by this method being dominated by other
generated solutions. It is therefore recommended using a
NondominatedPopulation to removed dominated solutions prior to
using the generated reference set.
The generated solutions should be spread uniformly across the entire
Pareto frontier; however, this is a suggestion and is not a requirement
of this interface.
Returns:
a randomly-generated Pareto optimal solution to this problem