A Revised Take on the Bee Optimization Algorithm Through Diverse Initialization, Adaptive Neighbors, Global Tracking, Gradual Reduction with Balanced Exploitation for Better Results

Hiteshkumar Nimbark (), Bhumit Jograna () and Sparsh Nimbark ()
Additional contact information
Hiteshkumar Nimbark: Gyanmanjari Innovative University, Bhavnagar, Gujarat, India
Bhumit Jograna: Gyanmanjari Innovative University, Bhavnagar, Gujarat, India
Sparsh Nimbark: Gyanmanjari Innovative University, Bhavnagar, Gujarat, India

RAIS Conference Proceedings 2022-2025 from Research Association for Interdisciplinary Studies

Abstract: The Bee Algorithm is a well-known swarm intelligence technique inspired by the foraging behavior of honeybees. Despite its success in solving various optimization problems, the standard version of the algorithm is often limited by several inherent weaknesses. These include poor diversity during the initial population setup, a fixed neighborhood search strategy that lacks adaptability, and the tendency to converge prematurely to suboptimal solutions. Additionally, many existing implementations fail to retain the best-found solution across iterations, leading to a drop in final solution quality. This paper introduces a modified version of the Bee Algorithm that addresses these issues through five targeted enhancements. The first involves a diversified initialization method that systematically distributes the initial population across the search space to prevent clustering and encourage broader exploration. The second introduces an adaptive neighborhood search radius that evolves with the number of iterations, providing a smooth transition from global search to local refinement. Third, a global best tracking mechanism is implemented to ensure the most optimal solution is retained throughout the process. Fourth, a gradual reduction strategy for the search radius prevents overly rapid convergence and maintains diversity for a longer period. Finally, the update scheme is adjusted to better balance exploitation of elite solutions and the integration of new candidates, which improves both convergence reliability and robustness. Comparative experiments using a set of well-established benchmark functions demonstrate that the proposed improvements consistently outperform the standard Bee Algorithm and several recent variants in terms of convergence speed, accuracy, and stability, without introducing significant computational overhead. The proposed modifications are easy to implement and offer a practical upgrade for applications where reliable global optimization is required.

Keywords: Artificial Bee Colony (ABC) Algorithm; Swarm Intelligence; Metaheuristic Optimization; Enhanced Bee Algorithm; Search Space Exploration and Exploitation; Dynamic Parameter Adaptation; Adaptive Neighborhood Search; Optimization Benchmarking (search for similar items in EconPapers)
Pages: 8 pages
Date: 2025-08
References: Add references at CitEc
Citations:

Published in Proceedings of the 41st International RAIS Conference on Social Sciences and Humanities, August 7-8, 2025, pages 199-207

Downloads: (external link)
https://rais.education/wp-content/uploads/0573.pdf Full text (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:smo:raiswp:0573

Access Statistics for this paper

More papers in RAIS Conference Proceedings 2022-2025 from Research Association for Interdisciplinary Studies
Bibliographic data for series maintained by Eduard David ().