The hybridized Harris hawk optimization and slime mould algorithm

20Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Both the Harris hawk optimization (HHO) algorithm proposed in 2016 and the slime moud algorithm proposed recently had complicated disciplines for individuals to update their positions. And both of them were proved to be capable of finding the best solutions for either benchmark functions or real engineering problems. In this paper, we further hybridized the SM and HHO algorithms and allowed the individuals in swarms to take more ways to update their positions. Simulation experiments were carried out and the better performance in either accuracy or convergence rate verified the capability of the hybridization.

Cite

CITATION STYLE

APA

Zhao, J., & Gao, Z. M. (2020). The hybridized Harris hawk optimization and slime mould algorithm. In Journal of Physics: Conference Series (Vol. 1682). IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/1682/1/012029

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