Equilibrium optimizer-based harmony search algorithm with nonlinear dynamic domains and its application to real-world optimization problems

Abstract

AbstractHarmony Search (HS) algorithm is a swarm intelligence algorithm inspired by musical improvisation. Although HS has been applied to various engineering problems, it faces challenges such as getting trapped in local optima, slow convergence speed, and low optimization accuracy when applied to complex problems. To address these issues, this paper proposes an improved version of HS called Equilibrium Optimization-based Harmony Search Algorithm with Nonlinear Dynamic Domains (EO-HS-NDD). EO-HS-NDD integrates multiple leadership-guided strategies from the Equilibrium Optimizer (EO) algorithm, using harmony memory considering disharmony and historical harmony memory, while leveraging the hidden guidance direction information from the Equilibrium Optimizer. Additionally, the algorithm designs a nonlinear dynamic convergence domain to adaptively adjust the search space size and accelerate convergence speed. Furthermore, to balance exploration and exploitation capabilities, appropriate adaptive adjustments are made to Harmony Memory Considering Rate (HMCR) and Pitch Adjustment Rate (PAR). Experimental validation on the CEC2017 test function set demonstrates that EO-HS-NDD outperforms HS and nine other HS variants in terms of robustness, convergence speed, and optimization accuracy. Comparisons with advanced versions of the Differential Evolution (DE) algorithm also indicate that EO-HS-NDD exhibits superior solving capabilities. Moreover, EO-HS-NDD is applied to solve 15 real-world optimization problems from CEC2020 and compared with advanced algorithms from the CEC2020 competition. The experimental results show that EO-HS-NDD performs well in solving real-world optimization problems.