In EDS ansehen

A stricter constraint dominance principle based algorithm for enhancing multi-performance in constrained multi-objective optimization.

Gespeichert in:
Bibliographische Detailangaben
Titel: A stricter constraint dominance principle based algorithm for enhancing multi-performance in constrained multi-objective optimization.
Autoren: Yu, Fan, Chen, Qun, Li, Yange, Zhou, Jinlong
Quelle: Journal of the Operational Research Society; Dec2025, Vol. 76 Issue 12, p2507-2531, 25p
Schlagwörter: MULTI-objective optimization, OPTIMIZATION algorithms, CONSTRAINT programming, MATHEMATICAL optimization, HETEROGENEITY, FEASIBILITY studies
Abstract: The feasibility requirement of constraints poses a severe obstacle to the algorithms' convergence and diversity when solving constrained multi-objective optimization problems (CMOPs) in science and engineering. This paper adopts a stricter constraint dominance principle, called SCDP, no longer only prioritizing the feasibility optimization while enhancing algorithmic conflicting multi-performance, such as convergence, diversity, and feasibility simultaneously. Firstly, the approach identifies the non-dominated constraints closest to the constrained Pareto Front (CPF) within the feasible regions. Subsequently, convergence, diversity, and feasibility are quantified as competing objectives that stricter the constraint dominance principle (CDP) to optimize multiple performances under non-dominated constraints. The effectiveness of the proposed SCDP is validated through the evaluation of 32 constrained multi-objective problems (CMOPs) and practical applications in the CMOP domain. The results demonstrate that the SCDP based algorithm can improve all the conflict multi-performance of the final solutions when solving CMOPs. [ABSTRACT FROM AUTHOR]
Copyright of Journal of the Operational Research Society is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:The feasibility requirement of constraints poses a severe obstacle to the algorithms' convergence and diversity when solving constrained multi-objective optimization problems (CMOPs) in science and engineering. This paper adopts a stricter constraint dominance principle, called SCDP, no longer only prioritizing the feasibility optimization while enhancing algorithmic conflicting multi-performance, such as convergence, diversity, and feasibility simultaneously. Firstly, the approach identifies the non-dominated constraints closest to the constrained Pareto Front (CPF) within the feasible regions. Subsequently, convergence, diversity, and feasibility are quantified as competing objectives that stricter the constraint dominance principle (CDP) to optimize multiple performances under non-dominated constraints. The effectiveness of the proposed SCDP is validated through the evaluation of 32 constrained multi-objective problems (CMOPs) and practical applications in the CMOP domain. The results demonstrate that the SCDP based algorithm can improve all the conflict multi-performance of the final solutions when solving CMOPs. [ABSTRACT FROM AUTHOR]
ISSN:01605682
DOI:10.1080/01605682.2025.2479136