View in EDS

A Constrained Multi-Objective Evolutionary Algorithm with Weak Constraint–Pareto Dominance and Angle Distance-Based Diversity Preservation.

Saved in:
Bibliographic Details
Title: A Constrained Multi-Objective Evolutionary Algorithm with Weak Constraint–Pareto Dominance and Angle Distance-Based Diversity Preservation.
Authors: Guo, Jinhao1,2 (AUTHOR), Shan, Yahui1,2 (AUTHOR) shanyahui@hust.edu.cn
Source: Mathematics (2227-7390). Nov2025, Vol. 13 Issue 22, p3696. 28p.
Subject Terms: *MULTI-objective optimization, *OPTIMIZATION algorithms, *MATHEMATICAL optimization
Abstract: In recent years, many constrained multi-objective evolutionary algorithms (CMOEAs) have primarily emphasized feasible solutions, overlooking the useful information contained in infeasible ones. This tendency effectively prioritizes feasibility over objective quality, often leading to the premature removal of infeasible solutions with strong convergence or diversity, thereby reducing performance on constrained multi-objective optimization problems (CMOPs) with complex or irregular feasible regions. To overcome these limitations, this paper introduces a weak constraint–Pareto dominance relation that integrates feasibility with objective performance, thereby preventing the premature elimination of infeasible solutions that may offer strong convergence or diversity. Moreover, an angle distance-based diversity maintenance strategy is proposed to preserve population diversity while ensuring solution feasibility. By combining these two mechanisms, we design the CMOEA-WA algorithm. Extensive experiments on benchmark and real-world problems confirm that the proposed method consistently outperforms state-of-the-art CMOEAs, achieving a more effective balance among feasibility, convergence, and diversity. [ABSTRACT FROM AUTHOR]
Database: Academic Search Index
Description
Abstract:In recent years, many constrained multi-objective evolutionary algorithms (CMOEAs) have primarily emphasized feasible solutions, overlooking the useful information contained in infeasible ones. This tendency effectively prioritizes feasibility over objective quality, often leading to the premature removal of infeasible solutions with strong convergence or diversity, thereby reducing performance on constrained multi-objective optimization problems (CMOPs) with complex or irregular feasible regions. To overcome these limitations, this paper introduces a weak constraint–Pareto dominance relation that integrates feasibility with objective performance, thereby preventing the premature elimination of infeasible solutions that may offer strong convergence or diversity. Moreover, an angle distance-based diversity maintenance strategy is proposed to preserve population diversity while ensuring solution feasibility. By combining these two mechanisms, we design the CMOEA-WA algorithm. Extensive experiments on benchmark and real-world problems confirm that the proposed method consistently outperforms state-of-the-art CMOEAs, achieving a more effective balance among feasibility, convergence, and diversity. [ABSTRACT FROM AUTHOR]
ISSN:22277390
DOI:10.3390/math13223696