手法を比較

	Jellyfish Search Optimizer	Aquila Optimizer	Particle Swarm Optimization (PSO)
分野	最適化	最適化	最適化
系統	Machine learning	Machine learning	Process / pipeline
提唱年	2022	2021	1995
提唱者	Xueying Shi	Laith Abualigah	—
種類	Nature-inspired metaheuristic algorithm	Nature-inspired metaheuristic algorithm	Population-based metaheuristic / swarm intelligence
原典	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.	Abualigah, L., Yousri, D., Abd Elaziz, M., Ewees, A. A., Al-qaness, M. A., & Gandomi, A. H. (2021). Aquila optimizer: A novel meta-heuristic optimization algorithm. Computers and Industrial Engineering, 157, 107250.	Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948.
別名	JSO	AO	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
関連	3	3	6
概要	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.	The Aquila Optimizer (AO) is a nature-inspired metaheuristic algorithm presented by Abualigah et al. in 2021, modeled after the hunting behavior and sensory abilities of golden eagles (aquila chrysaetos). The algorithm captures the exploration and exploitation phases of eagle hunting, including high-altitude soaring, exploration with high-precision vision, and rapid diving attacks. AO is designed to solve both constrained and unconstrained optimization problems.	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.