ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Optimizarea cu șoimi Harris×Optimizarea prin roi de particule (PSO)×
DomeniuOptimizareOptimizare
FamilieMachine learningProcess / pipeline
Anul apariției20191995
Autorul originalAli Asghar Heidari
TipNature-inspired metaheuristic algorithmPopulation-based metaheuristic / swarm intelligence
Sursa seminalăHeidari, 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 ↗Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗
Denumiri alternativeHHOPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Înrudite46
RezumatHarris 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.Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems.
ScholarGateSet de date
  1. v1
  2. 1 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Harris Hawks Optimization · Particle Swarm Optimization. Preluat la 2026-06-17 de pe https://scholargate.app/ro/compare