A New K means Grey Wolf Algorithm for Engineering Problems
Hardi M. Mohammed, Zrar Kh. Abdul, Tarik A. Rashid, Abeer Alsadoon,, Nebojsa Bacanin

TL;DR
This paper introduces a hybrid metaheuristic algorithm called K-means Grey Wolf Optimization (KMGWO) that enhances the original GWO by using K-means clustering to avoid local optima, demonstrating superior performance on benchmarks and engineering problems.
Contribution
The paper proposes a novel hybrid algorithm combining K-means clustering with GWO to improve optimization performance and avoid local optima in engineering applications.
Findings
KMGWO outperforms GWO on benchmark functions.
KMGWO ranks first compared to CSO, WOA-BAT, and WOA.
KMGWO achieves better results on a pressure vessel design problem.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Methodsk-Means Clustering
