.png){kind=icon}
.png){kind=icon}
Return
A dual-population multi operators harmony search algorithm for dynamic optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2018.01.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic optimization problems (DOPs) have been widely researched in recent years. This is due to its numerous practical applications in real-life conditions. To solve DOPs, the optimizer should be able to track the changes and simultaneously seek for global optima in the search space. This paper proposes a dual population multi operators harmony search algorithm for DOPs to deal with changes in the problem landscape. The main difference between the proposed algorithm and other techniques are twofold: dual population for exploring and exploiting the search space, and the use of multi operators at different points of the search. Extensive experiments were conducted on the Moving Peaks Benchmark (MPB) and six dynamic test functions proposed in the IEEE Congress on Evolutionary Computation (CEC 2009) were used to evaluate the performance of the proposed algorithm. Empirical results indicate the superiority of the proposed algorithm when compared to state-of-theart algorithms from the literature.
Keywords:
Dual population
Multi operators
Dynamic optimization
Harmony search
Algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W