摘要
Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems (MOPs). However, their performance often deteriorates when solving MOPs with irregular Pareto fronts. To remedy this issue, a large body of research has been performed in recent years and many new algorithms have been proposed. This paper provides a comprehensive survey of the research on MOPs with irregular Pareto fronts. We start with a brief introduction to the basic concepts, followed by a summary of the benchmark test problems with irregular problems, an analysis of the causes of the irregularity, and real-world optimization problems with irregular Pareto fronts. Then, a taxonomy of the existing methodologies for handling irregular problems is given and representative algorithms are reviewed with a discussion of their strengths and weaknesses. Finally, open challenges are pointed out and a few promising future directions are suggested.
学科与关键词
- A Multiobjective Evolutionary Algorithm Based on Objective-Space Localization SelectionZhou, Yuren; Chen, Zefeng*; Huang, Zhengxin; Xiang, YiIEEE Transactions on Cybernetics, 2022, 52(5): 3888-3901.被引 5
- Multiobjective evolutionary algorithms: A survey of the state of the artZhou, Aimin*; Qu, Bo-Yang; Li, Hui; Zhao, Shi-Zheng; Suganthan, Ponnuthurai Nagaratnam; Zhang, QingfuSwarm and Evolutionary Computation, 2011, 1(1): 32-49.被引 1600
- A Cone Decomposition Evolutionary Algorithm with Dominance-based Archive for Many-objective Optimization Problems with Irregular FrontsYing, Weiqin; Huang, Junjie; Wu, Yu*; Deng, Yali; Lan, YanqiIEEE Congress on Evolutionary Computation (CEC) as part of the IEEE World Congress on Computational Intelligence (IEEE WCCI), ELECTR NETWORK, 2020-07-19 To 2020-07-24.
