Skip to content
Review Open access

A Review of The Artificial Bee Colony (ABC) Algorithm: Variants, Applications, And Performance

Aug 2026 · International Journal of Engineering and Modern Technology · 0 citations

TL;DR

An integrated review of ABC is provided, covering its standard formulation, major variants, domain applications, benchmarking results, and emerging research directions, and highlights future opportunities in automated parameter tuning, multi‑objective optimization, and integration with deep learning frameworks.

Abstract

The Artificial Bee Colony (ABC) algorithm is a swarm intelligence technique inspired by the foraging behavior of honey bees. While widely studied, existing reviews often lack a comprehensive synthesis of algorithmic variants, comparative performance, and recent applications. This paper provides an integrated review of ABC, covering its standard formulation, major variants, domain applications, benchmarking results, and emerging research directions. A systematic survey of peer‑reviewed articles published between 2010 and 2025 was conducted using Scopus, Web of Science, IEEE Xplore, and ScienceDirect. Results show that hybrid ABC approaches (e.g., ABC combined with Differential Evolution) achieve up to 30% faster convergence and improved robustness under noisy conditions compared to the standard algorithm. Applications span engineering design, machine learning, telecommunications, cloud computing, and image processing, with reported gains in accuracy, efficiency, and scalability. The review identifies key limitations, including sensitivity to parameter settings and slower early convergence, and highlights future opportunities in automated parameter tuning, multi‑objective optimization, and integration with deep learning frameworks. This work contributes a holistic perspective by combining performance comparisons with application insights, offering a valuable resource for both researchers and practitioners.

Read PDF

Similar papers

Open access Aug 2026

On the Development and Application of a Modified Ant Colony Optimization (MACO) Algorithm for Solving Optimization Problems

This study presents the development and application of a Modified Ant Colony Optimization (MACO) algorithm incorporating constant variables to enhance solution efficiency in optimization problems. In the traditional Ant Colony Optimization (ACO) algorithms, though effective in solving combinatorial problems, they often...

K. Adebayo, Kehinde Solomon Omowaye, O. S. Adetolaju · 0 citations
Open access Oct 2026

A comparative study of standard PSO and adaptive fuzzy PSO for optimization

In engineering, complex optimization problems often require efficient and reliable solution methods. An example of a metaheuristic algorithm is particle swarm optimization (PSO), which is widely used for its simplicity and adaptability. However, PSO performance is highly sensitive to parameter settings. To tackle this...

P. O. Adebayo, W. Yahya, R. Jimoh · 0 citations
Open access Sep 2026

Artificial Bee Colony Algorithm with UCB-Guided Multi-Strategy Coordination

Results indicate favorable overall performance across standard benchmark functions, the CEC2014 test suite, and the investigated engineering design problem, where UMABC achieves the lowest Mean, Std, and Worst objective values among the six compared algorithms.

Yang Cao, Hong-Wei Hu, Yun-Peng Jia · 0 citations
Open access Sep 2026

An Adaptive Artificial Bee Colony Algorithm with Success-Driven Strategy Selection and Dimension Modification

The Artificial Bee Colony (ABC) algorithm demonstrates strong exploration but converges slowly. To address this, AMRABC_Ts introduces an adaptive dimension modification rate mechanism with two search strategies. The exploration-favoured CABC strategy uses random guidance, while the exploitation-favoured MABC_order stra...

Yang Cao, Xiao-Quan Yuan, Jing-Zheng Luan · 0 citations
Open access Sep 2026

On the Effectiveness of Memetic Search in Population-Based Metaheuristics for the One-Dimensional Cutting Stock Problem

Although population-based metaheuristic algorithms have been widely applied to the One-Dimensional Cutting Stock Problem (1D-CSP), their performance is often limited by premature convergence and insufficient local search capability. This study presents a comparative investigation of the effect of local search on four p...

Gözde Alp, Fatih Soygazi, Yılmaz Kılıçaslan · 0 citations
Open access Sep 2026

A Comparative Performance Analysis of Artificial Bee Colony, Genetic Algorithm, Particle Swarm Optimization, and Sine Cosine Algorithm for Training a Robust Cauchy-Huber Dendritic Neuron Model in Bitcoin Log-Return Forecasting

This study presents a comparative performance analysis of four population-based metaheuristic optimization algorithms - the Artificial Bee Colony (ABC), the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and the Sine Cosine Algorithm (SCA) - used to train a single, fixed robust neural architecture for crypt...

Mete Özdemir · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.