Methods › General › Optimization › Harris Hawks optimization (HHO)
Harris Hawks optimization
Harris Hawks optimization (HHO)
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
HHO is a popular swarm-based, gradient-free optimization algorithm with several active and time-varying phases of exploration and exploitation. This algorithm initially published by the prestigious Journal of Future Generation Computer Systems (FGCS) in 2019, and from the first day, it has gained increasing attention among researchers due to its flexible structure, high performance, and high-quality results. The main logic of the HHO method is designed based on the cooperative behaviour and chasing styles of Harris' hawks in nature called "surprise pounce". Currently, there are many suggestions about how to enhance the functionality of HHO, and there are also several enhanced variants of the HHO in the leading Elsevier and IEEE transaction journals.
From the algorithmic behaviour viewpoint, there are several effective features in HHO : Escaping energy parameter has a dynamic randomized time-varying nature, which can further improve and harmonize the exploratory and exploitive patterns of HHO. This factor also supports HHO to conduct a smooth transition between exploration and exploitation. Different exploration mechanisms with respect to the average location of hawks can increase the exploratory trends of HHO throughout initial iterations. Diverse LF-based patterns with short-length jumps enrich the exploitative behaviours of HHO when directing a local search. The progressive selection scheme supports search agents to progressively advance their position and only select a better position, which can improve the superiority of solutions and intensification powers of HHO throughout the optimization procedure. HHO shows a series of searching strategies and then, it selects the best movement step. This feature has also a constructive influence on the exploitation inclinations of HHO. The randomized jump strength can assist candidate solutions in harmonising the exploration and exploitation leanings. The application of adaptive and time-varying components allows HHO to handle difficulties of a feature space including local optimal solutions, multi-modality, and deceptive optima.
🔗 The source codes of HHO are publicly available at https://aliasgharheidari.com/HHO.html
Code snippet in the archive: a link on aliasgharheidari.com (archive link, not checked and not linked: not a code host this site links to).
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: Ensemble Feature Selection and Harris Hawks Optimization; Local Optimization; max-min optimization; ranking optimization; Document Optimization; Grounded Optimization; optimization framework; workspace optimization.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 5 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 5 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 5 of 5, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Diagnosis of Malignant Lymphoma Cancer Using Hybrid Optimized Techniques Based on Dense Neural Networks 9 Oct 2024 · 0 repositories · arXiv:2410.06974
-
Electric Vehicles coordination for grid balancing using multi-objective Harris Hawks Optimization 24 Nov 2023 · 0 repositories · arXiv:2311.14563
-
Harris Hawks Feature Selection in Distributed Machine Learning for Secure IoT Environments 20 Feb 2023 · 0 repositories · arXiv:2302.12205
-
Segmentation of Brain MRI using an Altruistic Harris Hawks' Optimization algorithm 17 Sep 2021 · 1 repository · arXiv:2109.08688
-
Sum-Rate Maximization for UAV-assisted Visible Light Communications using NOMA: Swarm Intelligence meets Machine Learning 10 Jan 2021 · 0 repositories · arXiv:2101.03498
Tasks archive 2025-07-28
4 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| BIG-bench Machine Learning | 1 |
| Diagnostic | 1 |
| Segmentation | 1 |
| feature selection | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections