Greedy Non‐Hierarchical Grey Wolf Optimizer (G-NHGWO)

An improved version of Grey Wolf Optimizer (GWO) introduced in a 2021 paper
319 Downloads
Aktualisiert 19. Okt 2021

Lizenz anzeigen

Grey wolf optimization (GWO) algorithm is a new emerging algorithm that is based on the social hierarchy of grey wolves as well as their hunting and cooperation strategies. Introduced in 2014, this algorithm has been used by a large number of researchers and designers, such that the number of citations to the original paper exceeded many other algorithms. In a recent study by Niu et al., one of the main drawbacks of this algorithm for optimizing real‐world problems was introduced. In summary, they showed that GWO's performance degrades as the optimal solution of the problem diverges from 0.
In Greedy Non‐Hierarchical Grey Wolf Optimizer (G-NHGWO), by introducing a straightforward modification to the original GWO algorithm, that is, neglecting its social hierarchy, we were able to largely eliminate this defect and open a new perspective for future use of this algorithm. The efficiency of the proposed method was validated by applying it to benchmark and real‐world engineering problems.
The reference paper (Open Access): http://dx.doi.org/10.1049/ell2.12176

Zitieren als

Ebrahim Akbari (2024). Greedy Non‐Hierarchical Grey Wolf Optimizer (G-NHGWO) (https://www.mathworks.com/matlabcentral/fileexchange/90802-greedy-non-hierarchical-grey-wolf-optimizer-g-nhgwo), MATLAB Central File Exchange. Abgerufen .

Akbari, Ebrahim, et al. “A Greedy Non-Hierarchical Grey Wolf Optimizer for Real-World Optimization.” Electronics Letters, Institution of Engineering and Technology (IET), Apr. 2021, doi:10.1049/ell2.12176.

Mehrere Stile anzeigen
Kompatibilität der MATLAB-Version
Erstellt mit R2019a
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Veröffentlicht Versionshinweise
1.0.3

Editing description.

1.0.1

Mentioning that the reference paper is Open Access.

1.0.0