Zobraziť v EDS

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

Uložené v:
Podrobná bibliografia
Názov: A Constrained Multi-Objective Evolutionary Algorithm with Weak Constraint–Pareto Dominance and Angle Distance-Based Diversity Preservation
Autori: Jinhao Guo, Yahui Shan
Zdroj: Mathematics, Vol 13, Iss 22, p 3696 (2025)
Informácie o vydavateľovi: MDPI AG, 2025.
Rok vydania: 2025
Zbierka: LCC:Mathematics
Predmety: constrained multi-objective, evolutionary algorithm, weak constraint–Pareto dominance, strong distance, angle distance, Mathematics, QA1-939
Popis: 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.
Druh dokumentu: article
Popis súboru: electronic resource
Jazyk: English
ISSN: 2227-7390
Relation: https://www.mdpi.com/2227-7390/13/22/3696; https://doaj.org/toc/2227-7390
DOI: 10.3390/math13223696
Prístupová URL adresa: https://doaj.org/article/50b47c24eab74a60a487f23f2ef47b49
Prístupové číslo: edsdoj.50b47c24eab74a60a487f23f2ef47b49
Databáza: Directory of Open Access Journals
Popis
Abstrakt: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.
ISSN:22277390
DOI:10.3390/math13223696