So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Thuật toán Nấm Nhầy× | Tối ưu hóa Bầy đàn Hạt (PSO)× | |
|---|---|---|
| Lĩnh vực | Tối ưu hóa | Tối ưu hóa |
| Họ≠ | Machine learning | Process / pipeline |
| Năm ra đời≠ | 2020 | 1995 |
| Người khởi xướng≠ | Shimin Li | — |
| Loại≠ | Nature-inspired metaheuristic algorithm | Population-based metaheuristic / swarm intelligence |
| Công trình gốc≠ | 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 ↗ |
| Tên gọi khác≠ | SMA | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| Liên quan≠ | 5 | 6 |
| Tóm tắt≠ | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|