Dynamic Constrained Multiobjective Evolutionary Algorithm With Multipopulation Prediction and Dynamic Fusion Ranking
IEEE Transactions on Evolutionary Computation · 2026-04 · 30 (2) · 688-701
DOI: 10.1109/tevc.2025.3569387 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2026-04. Verfasst von Dezheng Zhang und 7 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 40 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Program for Science and Technology Innovation Talents in Universities of Henan Province, Program for Science & Technology Innovation Teams in Universities of Henan Province.
Abstract (Originalsprache)
Dynamic constrained multiobjective optimization problems (DCMOPs) are widely existed in real-world applications and emerged as a prominent research focus in the evolutionary computation community. Current studies on DCMOPs face two main challenges: limited accuracy in population prediction, and a lack of effective strategies to improve static optimizer performance. To tackle these challenges, this article proposes a dynamic constrained multiobjective evolutionary algorithm based on multipopulation prediction and dynamic fusion ranking. Specifically, an efficient computer-vision-inspired point set registration method, named coherent point drift, is introduced to align individuals across successive environments. With the correspondences between two environments, the solution trajectory tracking problem is transformed as a point set registration problem. Based on the observed trajectory of solutions, the Pareto-optimal set or Pareto-optimal front in the new environment can be predicted. Additionally, this article highlights the importance of task-specific multipopulation prediction. After analysis the specific tasks of each population, different initial populations tailored to the tasks are predicted by the proposed prediction method. Finally, a dynamic fusion based two-ranking environmental selection strategy is proposed for the auxiliary task. This strategy dynamically integrates experience-based and constraint-based approaches, improving the auxiliary population evolutionary efficiency and its alignment with the main task. The superiority of proposed algorithm is validated through extensive experiments on a series of benchmark problems and a real-world raw ore allocation problem.
Förderung
- National Natural Science Foundation of China
- Program for Science and Technology Innovation Talents in Universities of Henan Province
- Program for Science & Technology Innovation Teams in Universities of Henan Province
- National Key Research and Development Program of China
- Key Research and Development Program of Henan
- Frontier Exploration Projects of Longmen Laboratory
Zitieren
APA
Zhang, D., Zhang, K., Yu, K., Liang, J., Qiao, K., Qu, B., Chen, K., & Yue, C. (2026). Dynamic Constrained Multiobjective Evolutionary Algorithm With Multipopulation Prediction and Dynamic Fusion Ranking. IEEE Transactions on Evolutionary Computation, 30(2), 688-701. https://doi.org/10.1109/tevc.2025.3569387
Vancouver
Zhang D, Zhang K, Yu K, Liang J, Qiao K, Qu B, et al. Dynamic Constrained Multiobjective Evolutionary Algorithm With Multipopulation Prediction and Dynamic Fusion Ranking. IEEE Transactions on Evolutionary Computation. 2026;30(2):688-701. doi:10.1109/tevc.2025.3569387
BibTeX
@article{Zhang2026,
author = {Zhang, Dezheng and Zhang, Kai and Yu, Kunjie and Liang, Jing and Qiao, Kangjia and Qu, Boyang and Chen, Ke and Yue, Caitong},
title = {Dynamic Constrained Multiobjective Evolutionary Algorithm With Multipopulation Prediction and Dynamic Fusion Ranking},
journal = {IEEE Transactions on Evolutionary Computation},
year = {2026},
volume = {30},
number = {2},
pages = {688--701},
doi = {10.1109/tevc.2025.3569387}
}
EUVIMED