.png){kind=icon}
.png){kind=icon}
Return
An improved differential harmony search algorithm for function optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-018-3139-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To overcome the drawbacks of the harmony search (HS) algorithm and further enhance its effectiveness and efficiency, an improved differential HS (IDHS) is proposed to solve numerical function optimization problems. The proposed IDHS has a novel improvisation scheme that integrates DE/best/1/bin and DE/rand/1/bin from the differential evolution (DE) algorithm to enhance its local search and exploration capabilities and a new pitch adjustment rule that benefits from the best solution in the harmony memory to increase its convergence speed. With dynamically adjusted parameters, the proposed IDHS can balance exploitation and exploration throughout the search process. The numerical results of an experiment with classic testing functions and those of a comparative experiment show that IDHS outperforms eight algorithms in the HS family and three widely used population-based algorithms in different families, including DE, particle swarm optimization, and improved fruit fly optimization algorithm. IDHS demonstrates fast convergence and an especially good capability to handle difficult high-dimensional optimization problems.
Keywords:
Harmony search algorithm
Differential evolution
Meta-heuristics
Global optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
No organization information available