Real-world constrained multi-objective optimization problems (CMOPs) commonly involve multiple constraints, and understanding and exploiting their coupling relationships is crucial for efficient optimization. Recent constraint-decoupling methods handle individual constraints separately, but they generally search only in the evolutionary direction to approximate single-constraint Pareto fronts (SCPFs). In this study, we show that part or all of the constrained Pareto front (CPF) may be unrelated to any SCPF and instead be shaped by the boundaries of infeasible regions. We refer to such a portion as the independent CPF (ICPF) and introduce the reverse CPF (RCPF) to characterize its associated informative infeasible boundaries. Based on these observations, we propose a bidirectional constraint-decoupling coevolutionary algorithm named DCF2D. DCF2D dynamically identifies the constraints obstructing the main population and activates constraint-specific auxiliary populations. These populations adaptively search in the evolutionary direction for the corresponding SCPFs or in the reverse evolutionary direction for the corresponding RCPFs. Its three-stage framework integrates unconstrained global exploration, event-driven bidirectional coevolution, and final convergence refinement. Experiments on 87 benchmark instances from seven test suites and 28 real-world engineering CMOPs demonstrate that DCF2D achieves the best overall performance among nine algorithms. Code available at: https://github.com/RuiqingS/DCF2D.

翻译：暂无翻译