ScholarGate
Asisten

Bandingkan metode

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

Particle Swarm Optimization (PSO)×Algoritma Cetakan Lendir×
BidangOptimasiOptimasi
KeluargaProcess / pipelineMachine learning
Tahun asal19952020
PencetusShimin Li
TipePopulation-based metaheuristic / swarm intelligenceNature-inspired metaheuristic algorithm
Sumber perintisKennedy, 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 ↗
AliasPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)SMA
Terkait65
RingkasanParticle 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.
ScholarGateSet data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 1 Sumber
  3. PUBLISHED

Ke halaman pencarian Unduh salindia

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