IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i3p415-d1327719.html
   My bibliography  Save this article

MSI-HHO: Multi-Strategy Improved HHO Algorithm for Global Optimization

Author

Listed:
  • Haosen Wang

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Jun Tang

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Qingtao Pan

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

Abstract

The Harris Hawks Optimization algorithm (HHO) is a sophisticated metaheuristic technique that draws inspiration from the hunting process of Harris hawks, which has gained attention in recent years. However, despite its promising features, the algorithm exhibits certain limitations, including the tendency to converge to local optima and a relatively slow convergence speed. In this paper, we propose the multi-strategy improved HHO algorithm (MSI-HHO) as an enhancement to the standard HHO algorithm, which adopts three strategies to improve its performance, namely, inverted S-shaped escape energy, a stochastic learning mechanism based on Gaussian mutation, and refracted opposition-based learning. At the same time, we conduct a comprehensive comparison between our proposed MSI-HHO algorithm with the standard HHO algorithm and five other well-known metaheuristic optimization algorithms. Extensive simulation experiments are conducted on both the 23 classical benchmark functions and the IEEE CEC 2020 benchmark functions. Then, the results of the non-parametric tests indicate that the MSI-HHO algorithm outperforms six other comparative algorithms at a significance level of 0.05 or greater. Additionally, the visualization analysis demonstrates the superior convergence speed and accuracy of the MSI-HHO algorithm, providing evidence of its robust performance.

Suggested Citation

  • Haosen Wang & Jun Tang & Qingtao Pan, 2024. "MSI-HHO: Multi-Strategy Improved HHO Algorithm for Global Optimization," Mathematics, MDPI, vol. 12(3), pages 1-24, January.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:3:p:415-:d:1327719
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/3/415/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/3/415/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Elifcan Yaşa & Dilek Tüzün Aksu & Linet Özdamar, 2022. "Metaheuristics for the stochastic post-disaster debris clearance problem," IISE Transactions, Taylor & Francis Journals, vol. 54(10), pages 1004-1017, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chang, Kuo-Hao & Chen, Tzu-Li & Yang, Fu-Hao & Chang, Tzu-Yin, 2023. "Simulation optimization for stochastic casualty collection point location and resource allocation problem in a mass casualty incident," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1237-1262.
    2. Shuvrangshu Jana & Rudrashis Majumder & Prathyush P. Menon & Debasish Ghose, 2022. "Decision Support System (DSS) for Hierarchical Allocation of Resources and Tasks for Disaster Management," SN Operations Research Forum, Springer, vol. 3(3), pages 1-30, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:3:p:415-:d:1327719. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.