Elk herd optimizer: a novel nature-inspired metaheuristic algorithm
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
This paper proposes a novel nature-inspired swarm-based optimization algorithm called elk herd optimizer (EHO). It is inspired by the breeding process of the elk herd. Elks have two main breeding seasons: rutting and calving. In the rutting season, the elk herd splits into different families of various sizes. This division is based on fighting for dominance between bulls, where the stronger bull can form a family with large numbers of harems. In the calving season, each family breeds new calves from its bull and harems. This inspiration is set in an optimization context where the optimization loop consists of three operators: rutting season, calving season, and selection season. During the selection season, all families are merged, including bulls, harems, and calves. The fittest elk herd will be selected for use in the upcoming rutting and calving seasons. In simple words, EHO divides the population into a set of groups, each with one leader and several followers in the rutting season. The number of followers is determined based on the fitness value of its leader group. Each group will generate new solutions based on its leader and followers in the calving season. The members of all groups including leaders, followers, and new solutions are combined and the fittest population is selected in the selection season. The performance of EHO is assessed using 29 benchmark optimization problems utilized in the CEC-2017 special sessions on real-parameter optimization and four traditional real-world engineering design problems. The comparative results were conducted against ten well-established metaheuristic algorithms and showed that the proposed EHO yielded the best results for almost all the benchmark functions used. Statistical testing using Friedman’s test post-hocked by Holm’s test function confirms the superiority of the proposed EHO when compared to other methods. In a nutshell, EHO is an efficient nature-inspired swarm-based optimization algorithm that can be used to tackle several optimization problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Holland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764
A Survey on Cloud Gaming: Future of Computer Games
Cai, W., Shea, R., Huang, C.-Y., Chen, K.-T., Liu, J., Leung, V. C. M., & Hsu, C.-H. (2016) · IEEE Access · doi:10.1109/access.2016.2590500 · Cited by 192
Metadata
- Authors
- Al-Betar, M. A., Awadallah, M. A., Braik, M. S., Makhadmeh, S., & Doush, I. A.
- Venue
- Artificial Intelligence Review
- Published
- 2024-02-12
- Volume
- 57
- Issue
- 3
- ISSN
- 0269-2821 (ISSN-L)
- 1573-7462
- OpenAlex
- W4391750982
- Cited by
- 176
- References
- 4
- FWCI
- 26.19
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Elk herd optimizer: a novel nature-inspired metaheuristic algorithm. https://app.cochat.ai/papers/10.1007/s10462-023-10680-4
- The paper
- Al-Betar, M. A., Awadallah, M. A., Braik, M. S., Makhadmeh, S., & Doush, I. A. (2024). Elk herd optimizer: a novel nature-inspired metaheuristic algorithm. Artificial Intelligence Review. https://doi.org/10.1007/s10462-023-10680-4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.