Porovnat metody

	Optimalizace Harrisových jestřábů	Optimalizace rojem částic (PSO)	Algoritmus slizovky (Slime Mould Algorithm)
Obor	Optimalizace	Optimalizace	Optimalizace
Rodina	Machine learning	Process / pipeline	Machine learning
Rok vzniku	2019	1995	2020
Tvůrce	Ali Asghar Heidari	—	Shimin Li
Typ	Nature-inspired metaheuristic algorithm	Population-based metaheuristic / swarm intelligence	Nature-inspired metaheuristic algorithm
Původní zdroj	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.	Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948.	Li, S., Chen, H., Wang, M., Heidari, A. A., & Chakraborty, S. (2020). Slime mould algorithm: A new method for stochastic optimization. Future Generation Computer Systems, 111, 300-323.
Další názvy	HHO	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)	SMA
Příbuzné	4	6	5
Shrnutí	Harris 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.	The Slime Mould Algorithm (SMA) is a nature-inspired metaheuristic optimization technique introduced by Li et al. in 2020. It mimics the behavior of slime moulds, which spread and contract to find optimal food sources. SMA addresses complex optimization problems by simulating the adaptive foraging and spatial distribution patterns of these organisms.