.png){kind=icon}
.png){kind=icon}
Return
A Solution Space Partitioning-Based Multipopulation Method for Dynamic Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2025.3597453.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Dynamic optimization
multipopulation
solution space partition
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W