A Decomposition-Based Multiobjective Evolutionary Algorithm with Adaptive Weight Adjustment

作者：Dai, Cai; Lei, Xiujuan^*

来源：Complexity, 2018, 2018: 1753071.

DOI：10.1155/2018/1753071

• NONDOMINATED SORTING APPROACH
• OPTIMIZATION ALGORITHM
• SELECTION
• MOEA/D
• PERFORMANCE

Recently, decomposition-based multiobjective evolutionary algorithms have good performances in the field of multiobjective optimization problems (MOPs) and have been paid attention by many scholars. Generally, a MOP is decomposed into a number of subproblems through a set of weight vectors with good uniformly and aggregate functions. The main role of weight vectors is to ensure the diversity and convergence of obtained solutions. However, these algorithms with uniformity of weight vectors cannot obtain a set of solutions with good diversity on some MOPs with complex Pareto optimal fronts (PFs) (i.e., PFs with a sharp peak or low tail or discontinuous PFs). To deal with this problem, an improved decomposition-based multiobjective evolutionary algorithm with adaptive weight adjustment (IMOEA/DA) is proposed. Firstly, a new method based on uniform design and crowding distance is used to generate a set of weight vectors with good uniformly. Secondly, according to the distances of obtained nondominated solutions, an adaptive weight vector adjustment strategy is proposed to redistribute the weight vectors of subobjective spaces. Thirdly, a selection strategy is used to help each subobjective space to obtain a nondominated solution (if have). Comparing with six efficient state-of-the-art algorithms, for example, NSGAII, MOEA/D, MOEA/D-AWA, EMOSA, RVEA, and KnEA on some benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence.

• 出版日期2018
• 单位陕西师范大学