Сравнение методов

	Оптимизация с помощью искусственной колонии пчел (ABC)	Генетический алгоритм	Оптимизация роем частиц (PSO)
Область	Оптимизация	Оптимизация	Оптимизация
Семейство	Process / pipeline	Process / pipeline	Process / pipeline
Год появления	2007	1975	1995
Автор метода	Dervis Karaboga & Bahriye Basturk	John Henry Holland	—
Тип	Swarm Intelligence Metaheuristic	Population-based metaheuristic	Population-based metaheuristic / swarm intelligence
Основополагающий источник	Karaboga, D., & Basturk, B. (2007). A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization, 39(3), 459–471.	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.	Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948.
Другие названия	ABC Algorithm, Bee Colony Optimization, Swarm-Based Bee Search, Yapay Arı Kolonisi	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Связанные	3	5	6
Сводка	Artificial Bee Colony (ABC) is a population-based swarm intelligence metaheuristic introduced by Karaboga and Basturk in 2007. It models the cooperative foraging behavior of a honey bee colony to search for optimal solutions in continuous numerical optimization problems. The algorithm divides candidate solutions among three bee types — employed, onlooker, and scout — and iteratively refines them through local search and probabilistic selection, making it well-suited for researchers and engineers tackling complex, multimodal optimization landscapes.	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.	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.