विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| स्लाइम मोल्ड एल्गोरिथम× | जेनेटिक एल्गोरिथम× | |
|---|---|---|
| क्षेत्र | अनुकूलन | अनुकूलन |
| परिवार≠ | Machine learning | Process / pipeline |
| उद्भव वर्ष≠ | 2020 | 1975 |
| प्रवर्तक≠ | Shimin Li | John Henry Holland |
| प्रकार≠ | Nature-inspired metaheuristic algorithm | Population-based metaheuristic |
| मौलिक स्रोत≠ | 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 ↗ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| उपनाम≠ | SMA | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| संबंधित | 5 | 5 |
| सारांश≠ | 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. | A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail. |
| ScholarGateडेटासेट ↗ |
|
|