Abstract
When a multiobjective evolutionary algorithm based on decomposition (MOEA/D) is applied to solve problems with discontinuous Pareto front (PF), a set of evenly distributed weight vectors may lead to many solutions assembling in boundaries of the discontinuous PF. To overcome this limitation, this article proposes a mechanism of resetting weight vectors (RWVs) for MOEA/D. When the RWV mechanism is triggered, a classic data clustering algorithm DBSCAN is used to categorize current solutions into several parts. A classic statistical method called principal component analysis (PCA) is used to determine the ideal number of solutions in each part of PF. Thereafter, PCA is used again for each part of PF separately and virtual targeted solutions are generated by linear interpolation methods. Then, the new weight vectors are reset according to the interrelationship between the optimal solutions and the weight vectors under the Tchebycheff decomposition framework. Finally, taking advantage of the current obtained solutions, the new solutions in the decision space are updated via a linear interpolation method. Numerical experiments show that the proposed MOEA/D-RWV can achieve good results for bi-objective and tri-objective optimization problems with discontinuous PF. In addition, the test on a recently proposed MaF benchmark suite demonstrates that MOEA/D-RWV also works for some problems with other complicated characteristics.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have