Improved whale optimization algorithm for solving constrained optimization problems

75Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In view of the shortcomings of the whale optimization algorithm (WOA), such as slow convergence speed, low accuracy, and easy to fall into local optimum, an improved whale optimization algorithm (IWOA) is proposed. First, the standard WOA is improved from the three aspects of initial population, convergence factor, and mutation operation. At the same time, Gaussian mutation is introduced. Then the nonfixed penalty function method is used to transform the constrained problem into an unconstrained problem. Finally, 13 benchmark problems were used to test the feasibility and effectiveness of the proposed method. Numerical results show that the proposed IWOA has obvious advantages such as stronger global search ability, better stability, faster convergence speed, and higher convergence accuracy; it can be used to effectively solve complex constrained optimization problems.

Cite

CITATION STYLE

APA

Ning, G. Y., & Cao, D. Q. (2021). Improved whale optimization algorithm for solving constrained optimization problems. Discrete Dynamics in Nature and Society, 2021. https://doi.org/10.1155/2021/8832251

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free