Slime Mould Algorithm
Also known as: SMA
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.
Key highlights
- Excellent balance between exploration and exploitation through adaptive weight mechanism
- Simple implementation with few hyperparameters to tune
- Demonstrates rapid convergence in early iterations with effective global search capability
- Applicable to both constrained and unconstrained optimization problems
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
Apply SMA to continuous and discrete optimization problems where gradient information is unavailable. It excels in multimodal landscapes with multiple local optima. Suitable for engineering design, parameter tuning, and feature selection when classical optimization methods fail or are computationally prohibitive.
Strengths & limitations
- Excellent balance between exploration and exploitation through adaptive weight mechanism
- Simple implementation with few hyperparameters to tune
- Demonstrates rapid convergence in early iterations with effective global search capability
- Applicable to both constrained and unconstrained optimization problems
- Performance can degrade on very high-dimensional problems due to increased search space
- Convergence speed varies significantly depending on problem landscape characteristics
- May require problem-specific tuning for complex engineering applications
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Applications
This section is available to Pro members. Upgrade to Pro
Frequently asked
How does the weight mechanism in SMA differ from other metaheuristics like PSO?
Unlike PSO which uses velocity vectors, SMA employs a time-decreasing weight that encourages exploitation as iterations progress. This adaptive strategy naturally balances exploration and exploitation without requiring separate parameters for cognitive and social components.
Is SMA suitable for solving constrained optimization problems?
Yes, SMA can handle constraints through penalty function methods or constraint-handling techniques. Infeasible solutions receive reduced fitness values, guiding the search toward the feasible region.
How should I set the population size for my problem?
Start with a population size proportional to problem dimensionality, typically 20-50 individuals. Larger populations improve global search but increase computational cost. Use empirical testing on your specific problem to find the balance.
What is the typical convergence behavior of SMA?
SMA typically shows rapid improvement in early iterations due to strong exploration, followed by refinement as the weight mechanism increasingly guides solutions toward the best found position.
Sources
- 1.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.
You have read it. What now?
Cite this page
ScholarGate. (2026, June 3). Slime Mould Algorithm. ScholarGate. https://scholargate.app/optimization/slime-mould-algorithm