EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

A Coevolutionary Algorithm Based on Constraints Decomposition for Constrained Multi-objective Optimization Problems

Guangpeng Li, Li Li, Guoyong Cai

International Journal of Computational Intelligence Systems · 05.05.2025 · 18 (1)

DOI: 10.1007/s44196-025-00830-7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Computational Intelligence Systems, online erschienen am 05.05.2025. Verfasst von Guangpeng Li und 2 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 61 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Innovation Project of GuangXi Graduate Education under Grand, Foundation of China under Grant, Guangxi Natural Science Foundation under Grant.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Constrained multi-objective optimization problems (CMOPs) are challenging for evolutionary algorithms (EAs). Due to the interaction of multiple constraints, the constrained Pareto fronts (CPFs) exhibit various complex characteristics, e.g., degeneracy, discontinuity or irregularity. Most algorithms achieve poor convergence and diversity performance on these problems. Therefore, we proposed a coevolutionary framework based on constraints decomposition to solve complex CMOPs. Specifically, this framework decomposes the CMOP into multiple help subproblems with a single constraint, thereby decoupling the complex constraints. Then, multiple subpopulations optimize these subproblems to assist in solving the original problem. In addition, a two-stage strategy is used to fully utilize the auxiliary populations to search for feasible solutions. In addition, an evolutionary state detection strategy based on historical information is proposed, which is used to determine whether the evolution moves to the next stage. The framework can take the advantage of the low complexity of single-constraint problems to help algorithm search the complete feasible regions. Experiments on benchmark problems show that the proposed algorithm is competitive with eight other most representative constrained evolutionary algorithms in terms of convergence and diversity performance.

Förderung

  • Innovation Project of GuangXi Graduate Education under Grand
  • Foundation of China under Grant
  • Guangxi Natural Science Foundation under Grant

Zitieren

APA

Li, G., Li, L., & Cai, G. (2025). A Coevolutionary Algorithm Based on Constraints Decomposition for Constrained Multi-objective Optimization Problems. International Journal of Computational Intelligence Systems, 18(1). https://doi.org/10.1007/s44196-025-00830-7

Vancouver

Li G, Li L, Cai G. A Coevolutionary Algorithm Based on Constraints Decomposition for Constrained Multi-objective Optimization Problems. International Journal of Computational Intelligence Systems. 2025;18(1). doi:10.1007/s44196-025-00830-7

BibTeX
@article{Li2025,
  author = {Li, Guangpeng and Li, Li and Cai, Guoyong},
  title = {A Coevolutionary Algorithm Based on Constraints Decomposition for Constrained Multi-objective Optimization Problems},
  journal = {International Journal of Computational Intelligence Systems},
  year = {2025},
  volume = {18},
  number = {1},
  doi = {10.1007/s44196-025-00830-7}
}
Kostenlos starten →