ScholarGate
Asszisztens

Módszerek összehasonlítása

Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.

Slime Mould Algorithm×A részecskesereg-optimalizálás (PSO)×
TudományterületOptimalizálásOptimalizálás
MódszercsaládMachine learningProcess / pipeline
Keletkezés éve20201995
MegalkotóShimin Li
TípusNature-inspired metaheuristic algorithmPopulation-based metaheuristic / swarm intelligence
Alapmű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 ↗Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗
Alternatív nevekSMAPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Kapcsolódó56
Összefoglaló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.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.
ScholarGateAdatkészlet
  1. v1
  2. 1 Források
  3. PUBLISHED
  1. v1
  2. 2 Források
  3. PUBLISHED

Ugrás a kereséshez Diák letöltése

ScholarGateMódszerek összehasonlítása: Slime Mould Algorithm · Particle Swarm Optimization. Letöltve 2026-06-17, forrás: https://scholargate.app/hu/compare