摘要
This letter suggests an approach for decomposing a multiobjective optimization problem (MOP) into a set of simple multiobjective optimization subproblems. Using this approach, it proposes MOEA/D-M2M, a new version of multiobjective optimization evolutionary algorithm-based decomposition. This proposed algorithm solves these subproblems in a collaborative way. Each subproblem has its own population and receives computational effort at each generation. In such a way, population diversity can be maintained, which is critical for solving some MOPs. Experimental studies have been conducted to compare MOEA/D-M2M with classic MOEA/D and NSGA-II. This letter argues that population diversity is more important than convergence in multiobjective evolutionary algorithms for dealing with some MOPs. It also explains why MOEA/D-M2M performs better.
学科与关键词
- Multi-objective decomposition evolutionary algorithm with objective modification-based dominance and external archiveWang, Zhenkun*; Li, Qingyan; Li, Genghui; Zhang, QingfuAPPLIED SOFT COMPUTING, 2023, 149: 111006.
- Decomposition Multi-Objective Optimisation Current Developments and Future OpportunitiesLi, Ke*; Zhang, QingfuGenetic and Evolutionary Computation Conference (GECCO), Boston, MA, 2022-07-09 To 2022-07-13.被引 1
- Local-Diversity Evaluation Assignment Strategy for Decomposition-Based Multiobjective Evolutionary AlgorithmYang, Shuling; Huang, Han*; Luo, Fan; Xu, Yang; Hao, ZhifengIEEE Transactions on Systems Man Cybernetics-Systems, 2023, 53(3): 1697-1709.
