constraint_none: NULL constraint handling method for MOEA/D

In fcampelo/MOEADr: Component-Wise MOEA/D Implementation

NULL constraint handling method for MOEA/D

Description

Construct the preference index matrix based only on performance values.

Usage

constraint_none(B, bigZ, bigV, ...)

Arguments

B	Matrix of neighborhoods (generated by define_neighborhood(...)))
bigZ	Matrix of scalarized objective values for each neighborhood and the incumbent solution (generated by scalarize_values)
bigV	Matrix of violation values for each neighborhood and the incumbent solution
...	other parameters (unused, included for compatibility with generic call)

Details

This function ignores the violation values when constructing the preference index matrix, using only the scalarized performance values.

Value

[ N x (T+1) ] matrix of preference indices. Each row i contains a permutation of {1, 2, ..., (T+1)}, where 1,...,T correspond to the solutions contained in the neighborhood of the i-th subproblem, B[i, ], and T+1 corresponds to the incumbent solution for that subproblem. The order of the permutation is defined by the increasing values of f(xk), where f(xk) is the aggregation function value of the k-th solution being compared.

References

F. Campelo, L.S. Batista, C. Aranha (2020): The MOEADr Package: A Component-Based Framework for Multiobjective Evolutionary Algorithms Based on Decomposition. Journal of Statistical Software doi: 10.18637/jss.v092.i06

fcampelo/MOEADr documentation built on Jan. 9, 2023, 6 a.m.