期刊
IEEE TRANSACTIONS ON CYBERNETICS
卷 52, 期 9, 页码 9559-9572出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2020.3021138
关键词
Statistics; Sociology; Optimization; Evolutionary computation; Search problems; Convergence; Sorting; Constrained multiobjective optimization problems (CMOPs); constraint satisfaction; evolutionary algorithm; objective optimization
类别
资金
- National Key Research and Development Program of China [2018AAA0100100]
- National Natural Science Foundation of China [61672033, 61822301, 61876123, 61906001, 61590922, U1804262]
- Hong Kong Scholars Program [XJ2019035]
- Anhui Provincial Natural Science Foundation [1808085J06, 2008085QF294, 1908085QF271]
- Key Program of Natural Science Project of Educational Commission of Anhui Province [KJ2019A0029]
- State Key Laboratory of Synthetical Automation for Process Industries [PAL-N201805]
- Research Grants Council of the Hong Kong Special Administrative Region, China [CityU11202418, CityU11209219]
- Royal Society International Exchanges Program [IEC\NSFC\170279]
The proposed two-stage evolutionary algorithm adjusts the balance between objective optimization and constraint satisfaction adaptively, addressing the difficulty of striking a good balance in complex feasible regions. Experimental studies demonstrate the superiority of the algorithm over state-of-the-art algorithms, especially on problems with complex feasible regions.
Both objective optimization and constraint satisfaction are crucial for solving constrained multiobjective optimization problems, but the existing evolutionary algorithms encounter difficulties in striking a good balance between them when tackling complex feasible regions. To address this issue, this article proposes a two-stage evolutionary algorithm, which adjusts the fitness evaluation strategies during the evolutionary process to adaptively balance objective optimization and constraint satisfaction. The proposed algorithm can switch between the two stages according to the status of the current population, enabling the population to cross the infeasible region and reach the feasible regions in one stage, and to spread along the feasible boundaries in the other stage. Experimental studies on four benchmark suites and three real-world applications demonstrate the superiority of the proposed algorithm over the state-of-the-art algorithms, especially on problems with complex feasible regions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据