ScholarGate
Asisten

Bandingkan metode

Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.

Algoritma Cetakan Lendir×Particle Swarm Optimization (PSO)×
BidangOptimasiOptimasi
KeluargaMachine learningProcess / pipeline
Tahun asal20201995
PencetusShimin Li
TipeNature-inspired metaheuristic algorithmPopulation-based metaheuristic / swarm intelligence
Sumber perintisLi, 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 ↗
AliasSMAPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Terkait56
RingkasanThe 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.
ScholarGateSet data
  1. v1
  2. 1 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED

Ke halaman pencarian Unduh salindia

ScholarGateBandingkan metode: Slime Mould Algorithm · Particle Swarm Optimization. Diakses 2026-06-15 dari https://scholargate.app/id/compare