Answers are grounded in this paper and cite their sources.
An algorithm improves solution uniformity while reducing premature convergence in constrained optimization, indicating effective resource allocation strategies.
Achieving a dynamic equilibrium among feasibility, convergence, and diversity remains a fundamental challenge in Constrained Multi-objective Optimization Problems (CMOPs). To address the limitations of conventional methods in handling complex constraints and resource allocation, this paper proposes a Dual-Population Cooperative Evolutionary Algorithm based on Relaxed Feasibility Selection and Shrinking Contribution Resource Allocation (RFSCMOEA). First, a relaxed feasibility selection strategy is designed with a dynamically shrinking threshold, allowing near-feasible solutions to survive in early stages to enhance boundary exploration. Second, a dual-criterion environmental selection mechanism integrates non-dominated sorting with k-nearest neighbor density estimation to prevent premature convergence and ensure solution uniformity. Furthermore, a dynamic resource allocation model optimizes computational configuration by adjusting offspring generation ratios based on the real-time evolutionary contribution of each population. Extensive experiments on 47 benchmark functions and 12 real-world engineering problems demonstrate that RFSCMOEA significantly outperforms eight state-of-the-art algorithms in Feasibility Rate, Inverted Generational Distance, and Hypervolume.
No takes yet. Share an insight, caveat, or question.
Li et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: