ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Algoritmus medojeda (Honey Badger Algorithm, HBA)×Optimalizace rojem částic (PSO)×
OborOptimalizaceOptimalizace
RodinaMachine learningProcess / pipeline
Rok vzniku20231995
TvůrceFatma A. Hashim
TypNature-inspired metaheuristic algorithmPopulation-based metaheuristic / swarm intelligence
Původní zdrojHashim, F. A., Hussain, K., & Houssein, E. H. (2023). Honey badger algorithm: A new meta-heuristic optimization algorithm. Neural Computing and Applications, 35(17), 12265-12287. link ↗Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗
Další názvyHBAPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Příbuzné56
ShrnutíThe Honey Badger Algorithm (HBA) is a nature-inspired metaheuristic optimization algorithm presented by Hashim et al. in 2023, modeled on the hunting behavior and intelligent strategies of honey badgers (Mellivora capensis). Honey badgers are known for their remarkable problem-solving abilities, fearlessness, and persistent pursuit of prey and food sources despite significant obstacles. HBA captures these behavioral traits to create an effective optimization framework.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.
ScholarGateDatová sada
  1. v1
  2. 1 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Honey Badger Algorithm · Particle Swarm Optimization. Získáno 2026-06-17 z https://scholargate.app/cs/compare