ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Оптимизация с ястреби Харис×Оптимизация чрез рояк от частици (PSO)×Алгоритъм на плъзгащата се плесен×
ОбластОптимизацияОптимизацияОптимизация
СемействоMachine learningProcess / pipelineMachine learning
Година на възникване201919952020
СъздателAli Asghar HeidariShimin Li
ТипNature-inspired metaheuristic algorithmPopulation-based metaheuristic / swarm intelligenceNature-inspired metaheuristic algorithm
Основополагащ източник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 ↗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. DOI ↗
Други названияHHOPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)SMA
Свързани465
Резюме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.
ScholarGateНабор от данни
  1. v1
  2. 1 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 1 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Harris Hawks Optimization · Particle Swarm Optimization · Slime Mould Algorithm. Извлечено на 2026-06-18 от https://scholargate.app/bg/compare