1
|
Yang Y, Zhang C. A Multi-Objective Carnivorous Plant Algorithm for Solving Constrained Multi-Objective Optimization Problems. Biomimetics (Basel) 2023; 8:biomimetics8020136. [PMID: 37092388 PMCID: PMC10123755 DOI: 10.3390/biomimetics8020136] [Citation(s) in RCA: 2] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/02/2023] [Revised: 03/21/2023] [Accepted: 03/24/2023] [Indexed: 03/29/2023] Open
Abstract
Satisfying various constraints and multiple objectives simultaneously is a significant challenge in solving constrained multi-objective optimization problems. To address this issue, a new approach is proposed in this paper that combines multi-population and multi-stage methods with a Carnivorous Plant Algorithm. The algorithm employs the ϵ-constraint handling method, with the ϵ value adjusted according to different stages to meet the algorithm’s requirements. To improve the search efficiency, a cross-pollination is designed based on the trapping mechanism and pollination behavior of carnivorous plants, thus balancing the exploration and exploitation abilities and accelerating the convergence speed. Moreover, a quasi-reflection learning mechanism is introduced for the growth process of carnivorous plants, enhancing the optimization efficiency and improving its global convergence ability. Furthermore, the quadratic interpolation method is introduced for the reproduction process of carnivorous plants, which enables the algorithm to escape from local optima and enhances the optimization precision and convergence speed. The proposed algorithm’s performance is evaluated on several test suites, including DC-DTLZ, FCP, DASCMOP, ZDT, DTLZ, and RWMOPs. The experimental results indicate competitive performance of the proposed algorithm over the state-of-the-art constrained multi-objective optimization algorithms.
Collapse
|
2
|
Zhou X, Cai X, Zhang H, Zhang Z, Jin T, Chen H, Deng W. Multi-strategy competitive-cooperative co-evolutionary algorithm and its application. Inf Sci (N Y) 2023. [DOI: 10.1016/j.ins.2023.03.142] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 04/03/2023]
|
3
|
An Ensemble Framework of Evolutionary Algorithm for Constrained Multi-Objective Optimization. Symmetry (Basel) 2022. [DOI: 10.3390/sym14010116] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022] Open
Abstract
In the real-world, symmetry or asymmetry widely exists in various problems. Some of them can be formulated as constrained multi-objective optimization problems (CMOPs). During the past few years, handling CMOPs by evolutionary algorithms has become more popular. Lots of constrained multi-objective optimization evolutionary algorithms (CMOEAs) have been proposed. Whereas different CMOEAs may be more suitable for different CMOPs, it is difficult to choose the best one for a CMOP at hand. In this paper, we propose an ensemble framework of CMOEAs that aims to achieve better versatility on handling diverse CMOPs. In the proposed framework, the hypervolume indicator is used to evaluate the performance of CMOEAs, and a decreasing mechanism is devised to delete the poorly performed CMOEAs and to gradually determine the most suitable CMOEA. A new CMOEA, namely ECMOEA, is developed based on the framework and three state-of-the-art CMOEAs. Experimental results on five benchmarks with totally 52 instances demonstrate the effectiveness of our approach. In addition, the superiority of ECMOEA is verified through comparisons to seven state-of-the-art CMOEAs. Moreover, the effectiveness of ECMOEA on the real-world problems is also evaluated for eight instances.
Collapse
|