Jellyfish Search Optimizer
Also known as: JSO
The Jellyfish Search Optimizer (JSO) is a biologically-inspired metaheuristic algorithm introduced by Shi et al. in 2022, based on the movement and foraging behavior of jellyfish in ocean environments. Jellyfish exhibit two distinct behaviors: passive drifting with ocean currents (exploration) and active swimming toward food sources (exploitation). JSO captures these behaviors to create an effective balance between global search and local refinement.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Apply JSO to continuous optimization problems including engineering design, function optimization, and machine learning parameter tuning. Particularly effective for multimodal problems with complex landscapes. Suitable for problems where gradient information is unavailable and robust global search is required.
Strengths & limitations
- Unique movement model combining passive drift and active swimming provides natural exploration-exploitation balance
- Strong empirical performance on diverse benchmark functions and real-world optimization problems
- Simple mathematical operations result in computationally efficient per-iteration cost
- Effective at maintaining population diversity and avoiding premature convergence
- Relatively new algorithm with limited long-term empirical validation in diverse domains
- Performance characteristics on very high-dimensional problems not extensively documented
- Convergence behavior varies depending on problem structure and initial population distribution
Frequently asked
How does JSO's passive drifting mechanism differ from other swarm algorithms?
Unlike algorithms where all individuals are attracted to the best solution uniformly, JSO individuals drift at varying rates depending on their relationship to the best solution, creating a more nuanced exploration-exploitation balance that resembles natural ocean current dynamics.
What is the role of random movement in JSO?
Random movements serve multiple purposes: they help individuals escape local optima, maintain population diversity, and prevent stagnation. The balance between drift and random movement is crucial for algorithm performance.
Is JSO suitable for constrained optimization?
Yes, JSO can handle constraints through penalty function methods where constraint violations reduce solution fitness. The drift and movement mechanisms naturally guide the search toward feasible regions as better solutions emerge.
How does population size affect JSO performance?
Population sizes typically range from 10-50 jellyfish. Larger populations improve exploration of the search space but increase computational cost. Start with 30 individuals and adjust based on problem complexity and convergence speed.
Sources
- Shi, X., Sun, Y., Zhan, Z. H., Yuen, K. F., & Zhang, J. (2022). Jellyfish search optimizer: A new bio-inspired metaheuristic algorithm for solving optimization tasks. Neural Computing and Applications, 34(10), 7651-7673. link ↗
How to cite this page
ScholarGate. (2026, June 3). Jellyfish Search Optimizer. ScholarGate. https://scholargate.app/en/optimization/jellyfish-search-optimizer
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Aquila OptimizerOptimization↔ compare
- Particle Swarm OptimizationOptimization↔ compare
- Slime Mould AlgorithmOptimization↔ compare