摘要
Multi-objective evolutionary algorithm based on Decomposition (MOEA/D) decomposes a multi-objective problem into a number of scalar optimization problems using uniformly distributed weight vectors. However, uniformly distributed weight vectors do not guarantee uniformity of solutions on approximated Pareto-Front. This study proposes an adaptive strategy to modify these scalarizing weights after regular intervals by assessing the crowdedness of solutions using crowding distance operator. Experiments carried out over several benchmark problems with complex Pareto-Fronts show that such a strategy helps in improving the convergence and diversity of solutions on approximated Pareto-Front. Proposed algorithm also shows better performance when compared with other state-of-the-art multi-objective algorithms over most of the benchmark problems.
学科与关键词
- What Weights Work for You? Adapting Weights for Any Pareto Front Shape in Decomposition-Based Evolutionary Multiobjective OptimisationLi, Miqing*; Yao, XinEVOLUTIONARY COMPUTATION, 2020, 28(2): 227-253.被引 106
- A Fuzzy Decomposition-Based Multi/Many-Objective Evolutionary AlgorithmLiu, Songbai; Lin, Qiuzhen*; Tan, Kay Chen; Gong, Maoguo; Coello, Carlos A. CoelloIEEE Transactions on Cybernetics, 2022, 52(5): 3495-3509.被引 21
- Multi-Objective Evolutionary Algorithm Based on Decomposition With Orthogonal Experimental DesignHe, Maowei; Wang, Zhixue; Chen, Hanning; Cao, Yang*; Ma, LianboEXPERT SYSTEMS, 2025, 42(2).
