arrow
返回

Solving Many-Objective Optimization Problems by a Pareto-Based Evolutionary Algorithm With Preprocessing and a Penalty Mechanism

delete2021-11-01
delete32
delete
OA
AI
Y
Yuan Liu
朱宁波 封面图
朱宁波 (Ningbo Zhu) *
M
Miqing Li
DOI:10.1109/TCYB.2020.2988896delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
It is known that the Pareto-based approach is not well suited for optimization problems with a large number of objectives, even though it is a class of mainstream methods in multiobjective optimization. Typically, a Pareto-based algorithm comprises two parts: 1) a Pareto dominance-based criterion and 2) a diversity estimator. The former guides the selection toward the optimal front, while the latter promotes the diversity of the population. However, the Pareto dominance-based criterion becomes ineffective in solving optimization problems with many objectives (e.g., more than 3) and, thus, the diversity estimator will determine the performance of the algorithm. Unfortunately, the diversity estimator usually has a strong bias toward dominance resistance solutions (DRSs), thereby failing to push the population forward. DRSs are solutions that are far away from the Pareto-optimal front but cannot be easily dominated. In this article, we propose a new Pareto-based algorithm to resolve the above issue. First, to eliminate the DRSs, we design an interquartile range method to preprocess the solution set. Second, to balance convergence and diversity, we present a penalty mechanism of alternating operations between selection and penalty. The proposed algorithm is compared with five state-of-the-art algorithms on a number of well-known benchmarks with 3-15 objectives. The experimental results show that the proposed algorithm can perform well on most of the test functions and generally outperforms its competitors.
Keyword:
Sociology
Statistics
Optimization
Convergence
Evolutionary computation
Maintenance engineering
Resistance
Dominance resistance solutions (DRSs)
evolutionary algorithm
many-objective optimization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

U
University of Birmingham
学者数:
4.1W
论文数: 3.8W
被引数: 5.0W
H
hunan university
学者数:
4.5W
论文数: 3.3W
被引数: 70
引用论文

引用论文

Performance of an easy-to-use prediction model for renal patient survival: an external validation study using data from the ERA-EDTA Registry
err2018-01-16
err0
errOAAI
errAline C Hemke; Martin B A Heemskerk; Merel van Diepen; Anneke Kramer; Johan de Meester; James G Heaf; José Maria Abad Diez; Marta Torres Guinea; Patrik Finne; Philippe Brunet; Bjørn E Vikse; Fergus J Caskey; Jamie P Traynor; Ziad A Massy; Cécile Couchoud; Jaap W Groothoff; Maurizio Nordio; Kitty J Jager; Friedo W Dekker; Andries J Hoitsma
err分享
err收藏
err分享
err收藏
err分享
err收藏
Guiding Evolutionary Multiobjective Optimization With Generic Front Modeling
err2020-03-01
err56
errOAAI
errTian, Ye; Zhang, Xingyi; Cheng, Ran; He, Cheng; Jin, Yaochu
err分享
err收藏
Carburizing
err
IF0
err1999-12-01
err0
PREAI
errGeoffrey Parrish
err分享
err收藏
学者 查看更多内容