EUVIMEDEUVIMED entdecken
Crossref

A Solution Space Partitioning-Based Multipopulation Method for Dynamic Optimization

Mai Peng, Changhe Li, Junchen Wang, Xinye Cai, Sanyou Zeng, Shengxiang Yang

IEEE Transactions on Evolutionary Computation · 2026-06 · 30 (3) · 1299-1313

DOI: 10.1109/tevc.2025.3597453 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2026-06. Verfasst von Mai Peng und 5 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 52 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Hubei Provincial Natural Science Foundation of China, Fundamental Research Funds of the AUST.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Dynamic optimization focuses on solving problems where the search space changes over time. The multipopulation method is the most widely used approach for addressing such problems. Traditional multipopulation methods often lack a deep understanding of the problem’s structural characteristics, such as the boundaries of basins of attraction (BoAs), which leads to redundant searches in less promising regions. Without guidance from these structural features, most populations are regenerated randomly, resulting in inefficient exploration. Furthermore, the search range for each population remains fixed and does not adapt to the BoAs, leading to the loss of tracking for certain peaks. To address these challenges, this article proposes a solution space partitioning based multipopulation method. The algorithm partitions the solution space into subspaces and leverages historical population data to assign an uncertainty property to each subspace. It further learns the problem’s BoAs to guide populations in exploiting within the BoAs while exploring outside them. A dual-layer exclusion mechanism dynamically adjusts the search and exclusion ranges based on the BoAs, ensuring precise control, preventing overlaps, and preserving diversity. Experimental results demonstrate that the proposed algorithm significantly outperforms state-of-the-art algorithms on generalized moving peaks benchmark, and a real-world problem: marine magnetic compensation problem.

Förderung

  • National Natural Science Foundation of China
  • Hubei Provincial Natural Science Foundation of China
  • Fundamental Research Funds of the AUST

Zitieren

APA

Peng, M., Li, C., Wang, J., Cai, X., Zeng, S., & Yang, S. (2026). A Solution Space Partitioning-Based Multipopulation Method for Dynamic Optimization. IEEE Transactions on Evolutionary Computation, 30(3), 1299-1313. https://doi.org/10.1109/tevc.2025.3597453

Vancouver

Peng M, Li C, Wang J, Cai X, Zeng S, Yang S. A Solution Space Partitioning-Based Multipopulation Method for Dynamic Optimization. IEEE Transactions on Evolutionary Computation. 2026;30(3):1299-1313. doi:10.1109/tevc.2025.3597453

BibTeX
@article{Peng2026,
  author = {Peng, Mai and Li, Changhe and Wang, Junchen and Cai, Xinye and Zeng, Sanyou and Yang, Shengxiang},
  title = {A Solution Space Partitioning-Based Multipopulation Method for Dynamic Optimization},
  journal = {IEEE Transactions on Evolutionary Computation},
  year = {2026},
  volume = {30},
  number = {3},
  pages = {1299--1313},
  doi = {10.1109/tevc.2025.3597453}
}
Kostenlos starten →