Methods › General › Optimization › Harris Hawks optimization (HHO)

Harris Hawks optimization

Harris Hawks optimization (HHO)

5 papers tagged archive 2025-07-28

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).

Papers archive 2025-07-28

5 shown of 5, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

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.

TaskPapers
BIG-bench Machine Learning1
Diagnostic1
Segmentation1
feature selection1

Usage over time archive 2025-07-28

Papers per year tagged with Harris Hawks optimization (HHO): 2021 to 2024, peak 2 2 0 2021: 2 papers 2021 2022: 0 papers 2022 2023: 2 papers 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (5 dated). Bars are counts, not a trend claim.

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

Optimization

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