进化算法
计算机科学
人工智能
进化计算
遗传算法
模式识别(心理学)
算法
算法设计
数学
进化规划
多样性(政治)
数学优化
约束优化
作者
Xiaoyu Zhong,Xiangjuan Yao,Kangjia Qiao,Dunwei Gong,Yaochu Jin
标识
DOI:10.1109/tevc.2026.3681168
摘要
Most existing constrained multi-objective evolutionary algorithms (CMOEAs) suffer from slow convergence and may even fail to find feasible solutions when dealing with problems that involve large-scale decision spaces and complex constraints. To this end, this paper introduces a promising region-guided CMOEA. In the proposed algorithm, a promising region detection and diversity enhancement strategy is designed to avoid entrapment in local optima. Specifically, this strategy first utilizes well-converged feasible non-dominated solutions among all solutions examined so far to detect the promising region where the constrained Pareto front may exist. Then, three non-dominated sorting procedures based on extended Pareto dominance, extended reverse Pareto dominance, and classical Pareto dominance, are sequentially executed to guide the population to evenly search the promising region and approach the constrained Pareto front from diverse search directions. In addition, an accelerated evolutionary search strategy is devised to improve reproduction quality in large-scale search spaces. Comprehensive experiments conducted on four benchmark test suites and thirty coal mine integrated energy system dispatch problems demonstrate the superiority of the proposed algorithm over seven state-of-the-art algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI