방법 비교

	박쥐 알고리즘	뻐꾸기 탐색	입자 군집 최적화 (PSO)
분야	최적화	최적화	최적화
계열	Process / pipeline	Process / pipeline	Process / pipeline
기원 연도	2010	2009	1995
창시자	Xin-She Yang	—	—
유형	Population-based swarm intelligence	Population-based metaheuristic / swarm intelligence	Population-based metaheuristic / swarm intelligence
원전	Yang, X.-S. (2010). A new metaheuristic bat-inspired algorithm. Nature Inspired Cooperative Strategies for Optimization (NICSO), 65–74.	Yang, X.S. & Deb, S. (2009). Cuckoo Search via Lévy Flights. 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 210-214. IEEE.	Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948.
별칭	BA, Bat-Inspired Algorithm, Echolocation-Based Optimization, Yarasa Algoritması	Guguk Kuşu Araması (Cuckoo Search), CS algorithm, Cuckoo Search via Lévy Flights	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
관련	3	6	6
요약	The Bat Algorithm (BA) is a nature-inspired metaheuristic optimization method proposed by Xin-She Yang in 2010. It mimics the echolocation behavior of microbats to balance global exploration and local exploitation. Each artificial bat adjusts its position, velocity, and emission frequency, with loudness and pulse rate dynamically controlling the transition from broad search to refined local tuning. BA is suited to continuous and combinatorial optimization problems across engineering, scheduling, and machine learning domains.	Cuckoo Search (CS) is a population-based metaheuristic optimization algorithm introduced by Xin-She Yang and Suash Deb in 2009. It models the obligate brood-parasitism of cuckoo birds — which lay eggs in other birds' nests — combined with Lévy flight random walks that enable long-range exploration of the search space. The algorithm has proven effective in structural engineering design, machine learning hyperparameter tuning, and other continuous black-box 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.