Harmony search based parameter ensemble adaptation for differential evolution (Q364517)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Harmony search based parameter ensemble adaptation for differential evolution |
scientific article; zbMATH DE number 6206856
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Harmony search based parameter ensemble adaptation for differential evolution |
scientific article; zbMATH DE number 6206856 |
Statements
Harmony search based parameter ensemble adaptation for differential evolution (English)
0 references
9 September 2013
0 references
Summary: In differential evolution (DE) algorithm, depending on the characteristics of the problem at hand and the available computational resources, different strategies combined with a different set of parameters may be effective. In addition, a single, well-tuned combination of strategies and parameters may not guarantee optimal performance because different strategies combined with different parameter settings can be appropriate during different stages of the evolution. Therefore, various adaptive/self-adaptive techniques have been proposed to adapt the DE strategies and parameters during the course of evolution. In this paper, we propose a new parameter adaptation technique for DE based on ensemble approach and harmony search algorithm (HS). In the proposed method, an ensemble of parameters is randomly sampled which form the initial harmony memory. The parameter ensemble evolves during the course of the optimization process by HS algorithm. Each parameter combination in the harmony memory is evaluated by testing them on the DE population. The performance of the proposed adaptation method is evaluated using two recently proposed strategies (DE/current-to-\(p\)best/bin and DE/current-to-gr\_best/bin) as basic DE frameworks. Numerical results demonstrate the effectiveness of the proposed adaptation technique compared to the state-of-the-art DE based algorithms on a set of challenging test problems.
0 references
0 references