The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Harris hawks optimization: Algorithm and applications
Open accessAbstract
Abstract In this paper, a novel population-based, nature-inspired optimization paradigm is proposed, which is called Harris Hawks Optimizer (HHO). The main inspiration of HHO is the cooperative behavior and chasing style of Harris’ hawks in nature called surprise pounce. In this intelligent strategy, several hawks cooperatively pounce a prey from different directions in an attempt to surprise it. Harris hawks can reveal a variety of chasing patterns based on the dynamic nature of scenarios and escaping patterns of the prey. This work mathematically mimics such dynamic patterns and behaviors to develop an optimization algorithm. The effectiveness of the proposed HHO optimizer is checked, through a comparison with other nature-inspired techniques, on 29 benchmark problems and several real-world engineering problems. The statistical results and comparisons show that the HHO algorithm provides very promising and occasionally competitive results compared to well-established metaheuristic techniques. Source codes of HHO are publicly available at http://www.alimirjalili.com/HHO.html and http://www.evo-ml.com/2019/03/02/hho .
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
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
Feeding innovations and forebrain size in birds
LEFEBVRE, L., WHITTLE, P., LASCARIS, E., & FINKELSTEIN, A. (1997) · Animal Behaviour · doi:10.1006/anbe.1996.0330 · Cited by 579
Cited by
Slime mould algorithm: A new method for stochastic optimization
Li, S., Chen, H., Wang, M., Heidari, A. A., & Mirjalili, S. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.03.055 · Cited by 3,036
Self-citationAbdollahzadeh, B., Gharehchopogh, F. S., & Mirjalili, S. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107408 · Cited by 1,438
Self-citationHoney Badger Algorithm: New metaheuristic algorithm for solving optimization problems
Hashim, F. A., Houssein, E. H., Hussain, K., Mabrouk, M. S., & Al-Atabany, W. (2022) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2021.08.013 · Cited by 1,296
An improved grey wolf optimizer for solving engineering problems
Nadimi-Shahraki, M. H., Taghian, S., & Mirjalili, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113917 · Cited by 1,153
Self-citationRUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method
Ahmadianfar, I., Heidari, A. A., Gandomi, A. H., Chu, X., & Chen, H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115079 · Cited by 1,115
Self-citation
Metadata
- Authors
- Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., & Chen, H.
- Venue
- Future Generation Computer Systems
- Publisher
- Elsevier BV
- Published
- 2019-08
- Volume
- 97
- Pages
- 849-872
- ISSN
- 0167-739X (ISSN-L)
- OpenAlex
- W2919979744
- Cited by
- 6,324
- References
- 5
- FWCI
- 260.05
- Type
- journal article
- Language
- en
- Open access
- green
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
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.
