手法を比較

	ホタルアルゴリズム	遺伝的アルゴリズム	Grey Wolf Optimizer
分野	最適化	最適化	最適化
系統	Process / pipeline	Process / pipeline	Process / pipeline
提唱年	2008	1975	2014
提唱者	Xin-She Yang	John Henry Holland	Seyedali Mirjalili, Seyed Mohammad Mirjalili, Andrew Lewis
種類	Swarm intelligence metaheuristic	Population-based metaheuristic	Swarm-intelligence metaheuristic
原典	Yang, X.S. (2010). Firefly Algorithm, Stochastic Test Functions and Design Optimisation. International Journal of Bio-Inspired Computation, 2(2), 78-84.	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.	Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014). Grey Wolf Optimizer. Advances in Engineering Software, 69, 46-61.
別名	FA, Firefly Optimization, Ateşböceği Algoritması (Firefly Algorithm)	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon	GWO, Gri Kurt Optimizasyonu, Gri Kurt Optimizasyonu (GWO)
関連	5	5	5
概要	The Firefly Algorithm (FA), introduced by Xin-She Yang in 2008 and formally published in 2010, is a nature-inspired swarm metaheuristic that models the bioluminescent attraction behaviour of fireflies. Each candidate solution is a firefly whose brightness represents its objective-function value; dimmer fireflies move toward brighter ones with an attraction force that decays with distance, driving the swarm toward optima without gradient information.	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.	The Grey Wolf Optimizer (GWO) is a swarm-intelligence metaheuristic introduced by Mirjalili, Mirjalili, and Lewis in 2014 that models the social hierarchy and cooperative hunting behaviour of grey wolves. A population of candidate solutions is divided into four leadership ranks — alpha, beta, delta, and omega — and the three best solutions at each iteration guide the entire swarm toward increasingly better regions of the search space.