ScholarGate
Assistent

Võrdle meetodeid

Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.

Jellyfish Search Optimizer×Particle Swarm Optimization (PSO)×
ValdkondOptimeerimineOptimeerimine
PerekondMachine learningProcess / pipeline
Tekkeaasta20221995
LoojaXueying Shi
TüüpNature-inspired metaheuristic algorithmPopulation-based metaheuristic / swarm intelligence
AlgallikasShi, 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 ↗Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗
RööpnimetusedJSOPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Seotud36
KokkuvõteThe 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.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.
ScholarGateAndmestik
  1. v1
  2. 1 Allikad
  3. PUBLISHED
  1. v1
  2. 2 Allikad
  3. PUBLISHED

Mine otsingusse Laadi slaidid alla

ScholarGateVõrdle meetodeid: Jellyfish Search Optimizer · Particle Swarm Optimization. Loetud 2026-06-18 aadressilt https://scholargate.app/et/compare