Abstrakt
In decomposition based algorithms the quality of the resulting solutions depends on the weights used in the decomposition scheme. Usually the weights are generated in the beginning and remain fixed during the evolution, which may lead to poor distribution of solutions along the Pareto front.
In this paper, we describe an extension of the popular MOEA/D algorithm which is able to tune the weights in order to find a set of solutions which maximizes a user specified objective. This adaptation is added as a new step to the algorithm which uses an approximation of the Pareto front to find suitable points in the objective space.
These points are translated back into weights in such way to lead MOEA/D to find these points.