.png){kind=icon}
.png){kind=icon}
Return
A clonal selection algorithm for dynamic multimodal function optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2018.10.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The objective of dynamic multimodal optimization problems (DMMOPs) is to find all global optima in a dynamic environment. Although dynamic optimization problems (DOPs) have been widely studied in the field of nature-inspired computation, DMMOPs have not yet been paid significant attention yet. It is a challenging task for the classic clonal selection algorithm (CSA) to track all the moving global optima of dynamic multimodal optimization problems. The population of the classic CSA tends to converge to a single optimum, and the shortage of population diversity prevents the classic CSA from adapting to environmental changes. To address these limitations, this paper proposes a so-called dynamic multimodal clonal selection algorithm (DMMCSA). DMMCSA incorporates a niching method called nearest-better clustering, and adapts the scale factor of the hypermutation operator according to the distances among individuals. Experiments on benchmark problems show that DMMCSA significantly outperforms CSA in terms of tracking all the global optima of DMMOPs.
Keywords:
Clonal selection algorithm
Dynamic optimization
Multimodal optimization
Benchmark problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W