ScholarGate
Assistente

Confronta i metodi

Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.

Harris Hawks Optimization×Aquila Optimizer×
CampoOttimizzazioneOttimizzazione
FamigliaMachine learningMachine learning
Anno di origine20192021
IdeatoreAli Asghar HeidariLaith Abualigah
TipoNature-inspired metaheuristic algorithmNature-inspired metaheuristic algorithm
Fonte seminaleHeidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., & Chen, H. (2019). Harris hawks optimization: Algorithm and applications. Future Generation Computer Systems, 97, 849-872. DOI ↗Abualigah, L., Yousri, D., Abd Elaziz, M., Ewees, A. A., Al-qaness, M. A., & Gandomi, A. H. (2021). Aquila optimizer: A novel meta-heuristic optimization algorithm. Computers and Industrial Engineering, 157, 107250. DOI ↗
AliasHHOAO
Correlati43
SintesiHarris Hawks Optimization (HHO) is a metaheuristic algorithm introduced by Heidari et al. in 2019, inspired by the hunting strategies of Harris's hawks. The algorithm models the cooperative hunting behavior and escape strategies of these raptors to solve complex optimization problems. HHO balances exploration through perching and exploitation through dynamic pursuit, making it effective for multimodal and high-dimensional optimization.The Aquila Optimizer (AO) is a nature-inspired metaheuristic algorithm presented by Abualigah et al. in 2021, modeled after the hunting behavior and sensory abilities of golden eagles (aquila chrysaetos). The algorithm captures the exploration and exploitation phases of eagle hunting, including high-altitude soaring, exploration with high-precision vision, and rapid diving attacks. AO is designed to solve both constrained and unconstrained optimization problems.
ScholarGateInsieme di dati
  1. v1
  2. 1 Fonti
  3. PUBLISHED
  1. v1
  2. 1 Fonti
  3. PUBLISHED

Vai alla ricerca Scarica le diapositive

ScholarGateConfronta i metodi: Harris Hawks Optimization · Aquila Optimizer. Consultato il 2026-06-17 da https://scholargate.app/it/compare