השוואת שיטות

	אופטימיזציית נחיל חלקיקים (PSO)	אלגוריתם רירתי
תחום	אופטימיזציה	אופטימיזציה
משפחה	Process / pipeline	Machine learning
שנת המקור	1995	2020
הוגה השיטה	—	Shimin Li
סוג	Population-based metaheuristic / swarm intelligence	Nature-inspired metaheuristic algorithm
מקור מכונן	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.
כינויים	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)	SMA
קשורות	6	5
תקציר	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.