Purpose: The development of metaheuristic algorithms has increased by
researchers to use them extensively in the field of business, science, and
engineering. One of the common metaheuristic optimization algorithms is called
Grey Wolf Optimization (GWO). The algorithm works based on imitation of the
wolves' searching and the process of attacking grey wolves. The main purpose of
this paper to overcome the GWO problem which is trapping into local optima.
Design or Methodology or Approach: In this paper, the K-means clustering
algorithm is used to enhance the performance of the original Grey Wolf
Optimization by dividing the population into different parts. The proposed
algorithm is called K-means clustering Grey Wolf Optimization (KMGWO).
Findings: Results illustrate the efficiency of KMGWO is superior to GWO. To
evaluate the performance of the KMGWO, KMGWO applied to solve 10 CEC2019
benchmark test functions. Results prove that KMGWO is better compared to GWO.
KMGWO is also compared to Cat Swarm Optimization (CSO), Whale Optimization
Algorithm-Bat Algorithm (WOA-BAT), and WOA, so, KMGWO achieves the first rank
in terms of performance. Statistical results proved that KMGWO achieved a
higher significant value compared to the compared algorithms. Also, the KMGWO
is used to solve a pressure vessel design problem and it has outperformed
results.
Originality/value: Results prove that KMGWO is superior to GWO. KMGWO is also
compared to cat swarm optimization (CSO), whale optimization algorithm-bat
algorithm (WOA-BAT), WOA, and GWO so KMGWO achieved the first rank in terms of
performance. Also, the KMGWO is used to solve a classical engineering problem
and it is superiorComment: 15 pages. World Journal of Engineering, 202