EUVIMEDEUVIMED entdecken
Crossref

Dynamic Grouping With a Self-Aware Computational Resource Allocation for Large-Scale Multi-Objective Optimization

Yuning Chen, Ziqing Zhou, Yi Liu, Linqiang Hu, Zhuo Zou, Lida Xu, Zhongxue Gan, Chun Ouyang

IEEE Transactions on Evolutionary Computation · 2026-04 · 30 (2) · 795-809

DOI: 10.1109/tevc.2025.3564335 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2026-04. Verfasst von Yuning Chen und 7 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 36 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Shanghai Municipal Science and Technology Major Project.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In real-world applications, many problems are characterized by numerous variables and conflicting objectives, which are referred to as large-scale multiobjective optimization problems (LSMOPs). The cooperative coevolution (CC) algorithm is commonly used to solve LSMOPs. The decision variables of the target problem are partitioned into groups with each group being solved independently. However, existing multiobjective CC algorithms encounter difficulties in accurately grouping variables by importance and lack effective methods for allocating computational resources to enhance solution efficiency. To address these challenges, a dynamic grouping method based on variable importance is introduced alongside a self-aware computational resource allocation mechanism. Our proposed algorithm calculates the importance of each variable by considering the impact of value fluctuations on each objective. Variables with similar importance levels are subsequently grouped together. Based on this, the resource allocation mechanism is proposed to monitor changes in the improvement rate of population quality during the optimization process across different variable groups, dynamically directing resources to groups of greater importance. The proposed algorithm was tested against five state-of-the-art large-scale multiobjective algorithms (RG-DRA, LERD, LMOCSO, LMEA, and FDV) using the LSMOP and WFG benchmark suites. It outperformed at least 75% of LSMOP instances and surpassed RG-DRA, LERD, and LMOCSO in over 50% of WFG instances, demonstrating comparable performance to LMEA and FDV.

Förderung

  • National Key Research and Development Program of China
  • National Natural Science Foundation of China
  • Shanghai Municipal Science and Technology Major Project
  • Shanghai Engineering Research Center of AI and Robotics, Fudan University, China
  • Engineering Research Center of AI & Robotics, Ministry of Education, China

Zitieren

APA

Chen, Y., Zhou, Z., Liu, Y., Hu, L., Zou, Z., Xu, L., Gan, Z., & Ouyang, C. (2026). Dynamic Grouping With a Self-Aware Computational Resource Allocation for Large-Scale Multi-Objective Optimization. IEEE Transactions on Evolutionary Computation, 30(2), 795-809. https://doi.org/10.1109/tevc.2025.3564335

Vancouver

Chen Y, Zhou Z, Liu Y, Hu L, Zou Z, Xu L, et al. Dynamic Grouping With a Self-Aware Computational Resource Allocation for Large-Scale Multi-Objective Optimization. IEEE Transactions on Evolutionary Computation. 2026;30(2):795-809. doi:10.1109/tevc.2025.3564335

BibTeX
@article{Chen2026,
  author = {Chen, Yuning and Zhou, Ziqing and Liu, Yi and Hu, Linqiang and Zou, Zhuo and Xu, Lida and Gan, Zhongxue and Ouyang, Chun},
  title = {Dynamic Grouping With a Self-Aware Computational Resource Allocation for Large-Scale Multi-Objective Optimization},
  journal = {IEEE Transactions on Evolutionary Computation},
  year = {2026},
  volume = {30},
  number = {2},
  pages = {795--809},
  doi = {10.1109/tevc.2025.3564335}
}
Kostenlos starten →