Hybridized elephant herding optimization algorithm for constrained optimization

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

Abstract

This paper introduces hybridized elephant herding optimization algorithm (EHO) adopted for solving constrained optimization problems. EHO is one of the latest swarm intelligence metaheuristic and the implementation of the EHO for constrained optimization was not found in literature. In order to evaluate the performance of the hybridized EHO algorithm, we conducted tests on 13 standard constrained benchmark functions. To prove efficiency and robustness of the hybridized EHO, a comparative analysis with basic EHO implementation, as well as with other state-of-the-art algorithms, such as firefly algorithm, seeker optimization algorithm and self-adaptive penalty function genetic algorithm was performed. Experiments show that the hybridized EHO on average outperforms other algorithms used in comparative analysis.

Cite

CITATION STYLE

APA

Strumberger, I., Bacanin, N., & Tuba, M. (2018). Hybridized elephant herding optimization algorithm for constrained optimization. In Advances in Intelligent Systems and Computing (Vol. 734, pp. 158–166). Springer Verlag. https://doi.org/10.1007/978-3-319-76351-4_16

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