An improved grey wolf optimizer for solving engineering problems

Mohammad H. Nadimi-Shahraki, Shokooh Taghian, Seyedali Mirjalili

Research output: Contribution to journalArticlepeer-review

442 Citations (Scopus)


In this article, an Improved Grey Wolf Optimizer (I-GWO) is proposed for solving global optimization and engineering design problems. This improvement is proposed to alleviate the lack of population diversity, the imbalance between the exploitation and exploration, and premature convergence of the GWO algorithm. The I-GWO algorithm benefits from a new movement strategy named dimension learning-based hunting (DLH) search strategy inherited from the individual hunting behavior of wolves in nature. DLH uses a different approach to construct a neighborhood for each wolf in which the neighboring information can be shared between wolves. This dimension learning used in the DLH search strategy enhances the balance between local and global search and maintains diversity. The performance of the proposed I-GWO algorithm is evaluated on the CEC 2018 benchmark suite and four engineering problems. In all experiments, I-GWO is compared with six other state-of-the-art metaheuristics. The results are also analyzed by Friedman and MAE statistical tests. The experimental results and statistical tests demonstrate that the I-GWO algorithm is very competitive and often superior compared to the algorithms used in the experiments. The results of the proposed algorithm on the engineering design problems demonstrate its efficiency and applicability.

Original languageEnglish
Article number113917
JournalExpert Systems with Applications
Publication statusPublished - 15 Mar 2021


  • Algorithm
  • Artificial intelligence
  • Engineering optimization problems
  • Grey wolf optimizer
  • Improved grey wolf optimizer
  • Metaheuristic
  • Optimization
  • Swarm intelligence algorithm


Dive into the research topics of 'An improved grey wolf optimizer for solving engineering problems'. Together they form a unique fingerprint.

Cite this