返回
Evolutionary Multi/Many-Objective Optimisation via Bilevel Decomposition
DOI:10.1109/JAS.2024.124515.png)
摘要
En 中文
Decomposition of a complex multi-objective optimisation problem (MOP) to multiple simple subMOPs, known as M2M for short, is an effective approach to multi-objective optimisation. However, M2M facilitates little communication/collaboration between subMOPs, which limits its use in complex optimisation scenarios. This paper extends the M2M framework to develop a unified algorithm for both multi-objective and many-objective optimisation. Through bilevel decomposition, an MOP is divided into multiple subMOPs at upper level, each of which is further divided into a number of single-objective subproblems at lower level. Neighbouring subMOPs are allowed to share some subproblems so that the knowledge gained from solving one sub-MOP can be transferred to another, and eventually to all the sub-MOPs. The bilevel decomposition is readily combined with some new mating selection and population update strategies, leading to a high-performance algorithm that competes effectively against a number of state-of-the-arts studied in this paper for both multi- and many-objective optimisation. Parameter analysis and component analysis have been also carried out to further justify the proposed algorithm.
Keyword:
Bilevel decomposition
evolutionary algorithm
many-objective optimisation
multi-objective optimisation
期刊
I
IF:
19.2
论文数:
1.4K
被引数:
1.1W
机构
引用论文
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法
Evolutionary Multitasking with Global and Local Auxiliary Tasks for Constrained Multi-Objective Optimization具有全局和局部辅助任务的进化多任务处理,用于约束多目标优化
Chain-reaction solution update in MOEA/D and its effects on multi- and many-objective optimization
SOFT COMPUTING
IF2.5

