Balancing Objective Optimization and Constraint Satisfaction in Constrained Evolutionary Multiobjective Optimization
By Ye Tian, Yajie Zhang, Yansen Su, Xing-yi Zhang, Kay Chen Tan, Yaochu Jin. IEEE Transactions on Cybernetics, 2021
305 citations recorded by the source corpus.
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.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/165116216bc506b3adffdf234c9715a49af85295
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computational Theory and Mathematics
Citations in the corpus
- A Survey on Evolutionary Constrained Multiobjective Optimization (2023, methodology): “Tian et al. [95] used the CMOEA-MS algorithm to solve the car side impact problem, vibration platform design problem, and water resource problem.”