পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| Slime Mould Algorithm× | পার্টিকেল সোয়ার্ম অপ্টিমাইজেশন (PSO)× | |
|---|---|---|
| ক্ষেত্র | অনুকূলকরণ | অনুকূলকরণ |
| পরিবার≠ | Machine learning | Process / pipeline |
| উদ্ভবের বছর≠ | 2020 | 1995 |
| প্রবর্তক≠ | Shimin Li | — |
| ধরন≠ | Nature-inspired metaheuristic algorithm | Population-based metaheuristic / swarm intelligence |
| মৌলিক উৎস≠ | 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 ↗ |
| অপর নাম≠ | SMA | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| সম্পর্কিত≠ | 5 | 6 |
| সারসংক্ষেপ≠ | 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. |
| ScholarGateডেটাসেট ↗ |
|
|