.png){kind=icon}
.png){kind=icon}
Return
A novel hybrid bat algorithm for solving continuous optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2018.08.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Bat Algorithm (BA), which is a global optimization method, performs poorly on complex continuous optimization problems due to BA's disadvantages such as the premature convergence problem. In this paper, we propose a novel Hybrid Bat Algorithm (HBA) to improve the performance of BA. Three modification methods are incorporated into the standard BA to enhance the local search capability and the ability to escape from local optimum traps. The effectiveness and contribution of these three modification methods are analyzed by using classical benchmark functions. Moreover, the performance of HBA is evaluated on the numerical functions from the CEC 2014 test suite and compared with those of wellknown optimization algorithms. The statistical test results indicate that HBA is a significant improvement. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Hybrid algorithm
Bat algorithm
Extremal optimization
Continuous optimization problems
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.6
Papers:
1.4W
Citations:
4.8W