moead_framework.aggregation.tchebycheff.Tchebycheff

class moead_framework.aggregation.tchebycheff.Tchebycheff

Bases: moead_framework.aggregation.functions.AggregationFunction

Tchebycheff aggregation function.

Minimize the maximal distance |f_i(x) - z_i(x)| * w_i

Methods

__init__	Initialize self.
is_better(old_value, new_value)	Allow to compare 2 aggregations values for the tchebycheff function in a minimization context.
run(solution, number_of_objective, weights, …)	Compute the Tchebycheff value.

is_better(old_value, new_value)

Allow to compare 2 aggregations values for the tchebycheff function in a minimization context.

Parameters

• old_value – {float} old aggregation value

• new_value – {float} new aggregation value

Returns

{boolean} True if new_value is better than old_value.

run(solution, number_of_objective, weights, sub_problem, z)

Compute the Tchebycheff value.

Parameters

• solution – {OneDimensionSolution}

• number_of_objective – {integer} number of objective

• weights – {list<list<integer>>} List of weight vectors

• sub_problem – {integer} index of the sub-problem / weight vector

• z – {list<float>} coordinates of the reference point Z*

Returns

{float} the aggregation value of the solution for the weight vector: weights[sub-problem]