Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Slime Mould Algorithm× | Partikelsvärmsoptimering (PSO)× | |
|---|---|---|
| Ämnesområde | Optimering | Optimering |
| Familj≠ | Machine learning | Process / pipeline |
| Ursprungsår≠ | 2020 | 1995 |
| Upphovsperson≠ | Shimin Li | — |
| Typ≠ | Nature-inspired metaheuristic algorithm | Population-based metaheuristic / swarm intelligence |
| Ursprungskälla≠ | 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 ↗ |
| Alias≠ | SMA | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| Närliggande≠ | 5 | 6 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|