Constrained multi-objective optimization problems (CMOPs) involve optimizing multiple conflicting objectives subject to at least oneconstraint. Theseconstraints often divide the search space into various infeasible ...
详细信息
Constrained multi-objective optimization problems (CMOPs) involve optimizing multiple conflicting objectives subject to at least oneconstraint. Theseconstraints often divide the search space into various infeasible regions and narrow or disconnected feasible regions. Most existing constrained multi-objectiveevolutionary algorithms struggle with imbalanced exploration between feasible and infeasible regions and exhibit poor search capabilities, resulting in populations becoming trapped in locally optimal feasible or infeasible areas. To overcome this limitation, we propose a novel constrained multi-objective state transition algorithm via adaptive bidirectional coevolution (CMOSTA). This algorithm comprises amain population (MP) and a cooperative population (CP), facilitating balanced exploration of both feasible and infeasible regions. CMOSTA adapts environmental selection strategies based on the proportion and distribution of feasible solutions within the MP , promoting efficient information sharing and avoiding unnecessary searches. Additionally, a dynamiceconstraint relaxation strategy is put forward for the MP to prevent stagnation in locally feasible areas. A mating selection approach combining binary tournament and dynamice-constrained dominance is developed, followed by state transformation operators to generate candidate solutions with both global and local search capabilities. Theeffectiveness of CMOSTA is verified through 62 benchmark tests and an industrial case study on optimal copper removal, showing superior performance compared to ten well-established constrained multi-objectiveevolutionary algorithms.
暂无评论