水准点(测量)
数学优化
人口
多目标优化
计算机科学
进化算法
趋同(经济学)
鉴定(生物学)
功能(生物学)
帕累托原理
最优化问题
惩罚法
约束优化
可行区
遗传算法
进化计算
数学
任务(项目管理)
代表(政治)
控制理论(社会学)
进化策略
进化规划
相(物质)
作者
Zhengpeng Hu,Xiaobing Yu,Junhua Zhu,Gary G. Yen,Yu Xue
标识
DOI:10.1109/tsmc.2025.3648724
摘要
Existing constrained multiobjective evolutionary algorithms (CMOEAs) frequently employ the information provided by the unconstrained Pareto front (UPF) to facilitate the identification of the constrained Pareto front (CPF) for constrained multiobjective optimization problems (CMOPs). However, obtaining a UPF with favorable convergence and diversity is not straightforward, and the obtained UPF is sometimes difficult to effectively assist in the identification of CPF for certain complex CMOPs. To this end, a novel algorithm called DREMCO is proposed, which endeavors to obtain a good UPF and is capable of utilizing the obtained UPF to consistently assist in the identification of CPF. DREMCO consists of a main population for the original problem and a two-phase (propulsion phase and recovery phase) auxiliary population with a dynamics regulation mechanism. In the propulsion phase, the auxiliary population ignores constraints and employs an improved aggregation function to obtain a good UPF, thereby pulling the main population across infeasible regions. In the recovery phase, the auxiliary population uses a penalty function method to converge to CPF and continuously refines the CPF of the main population. Concurrently, a novel phase judgment method is proposed for seamless transition between phases. Furthermore, an information-sharing strategy is proposed, which is capable of sharing information of the parents and offspring in offspring generation and environment selection, respectively. The experimental results with 11 state-of-the-art CMOEAs on five benchmark suites and eight real-world CMOPs demonstrate the efficacy of the proposed algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI