.png){kind=icon}
Return
Solving dynamic multimodal optimization problems via a niching-based brain storm optimization with two archives algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101649.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic and multimodal properties are simultaneously possessed in the dynamic multimodal optimization problems (DMMOPs), which aim to find multiple optimal solutions in a dynamic environment. However, more work still needs to be devoted to solving DMMOPs, which still require significant attention. A nichingbased brain storm optimization with two archives (NBSO2A) algorithm is proposed to solve DMMOPs. The two niching methods, i.e. , neighborhood-based speciation (NS), and nearest-better clustering (NBC), are incorporated into a BSO algorithm to generate new solutions. The two archives preserve the optimal solutions that meet the requirements and practical, inferior solutions discarded during the generation. Improved taboo area (ITA) removes highly similar individuals from the population. An evolution strategy with covariance matrix adaptation (CMA-ES) is adopted to enhance the local search ability and improve the quality of the solutions. The NBSO2A algorithm and four other algorithms were tested on 12 benchmark problems to validate the performance of the NBSO2A algorithm on DMMOPs. The experimental results show that the NBSO2A algorithm outperforms the other compared algorithms on most tested benchmark problems.
Keywords:
Brain storm optimization
Dynamic optimization
Multimodal optimization
Dynamic multimodal optimization
Embodied swarm intelligence
Swarm optimization algorithm
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
ShareSaveShareSave View more