Empirical study of the Bee Colony Optimization (BCO) algorithm
Milos Nikolic2013, Expert Systems with Applications
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
The Bee Colony Optimization (BCO) meta-heuristic deals with combinatorial optimization problems. It is biologically inspired method that explores collective intelligence applied by the honey bees during nectar collecting process. In this paper we perform empirical study of the BCO algorithm. We apply BCO to optimize numerous numerical test functions. The obtained results are compared with the results in the literature. The numerical experiments performed on well-known benchmark functions show that the BCO is competitive with other methods and it can generate high-quality solutions within negligible CPU times.
Figures (3)
Related papers
Bee Colony Optimization Overview
The Bee Colony Optimization (BCO) meta-heuristic belongs to the class of Nature-Inspired Algorithms. This technique uses an analogy between the way in which bees in nature search for a food, and the way in which optimization algorithms search for an optimum in combinatorial optimization problems. Artificial bees represent agents, which collaboratively solve complex combinatorial optimization problem. The chapter presents a description of the algorithm, classification and analysis of the results achieved using Bee Colony Optimization (BCO) to model complex engineering and management processes.
The Applications Survey on Bee Colony Optimization
2012
Swarm Intelligence is the most studied area by several researchers it is the part of AI based on the study of actions of individuals in various decentralized system. The BCO metaheuristics has been introduced fairly recently as a new direction in the field of Swarm Intelligence. Artificial Bee represents agents which collaboratively solve complex combinatorial optimization problem. It was introduced in 2005 and has been applied to solve different optimization problems in various areas. BCO is a benchmark system which shows the team work and applied in various optimization problem. Keywords—Swarm Intelligence (SI), Bee Colony Optimization (BCO), Artificial Bee Colony (ABC).
Bee Colony Optimization - part I: The algorithm overview
Yugoslav Journal of Operations Research, 2014
This paper is an extensive survey of the Bee Colony Optimization (BCO) algorithm, proposed for the first time in 2001. BCO and its numerous variants belong to a class of nature-inspired meta-heuristic methods, based on the foraging habits of honeybees. Our main goal is to promote it among the wide operations research community. BCO is a simple, but efficient meta-heuristic technique that has been successfully applied to many optimization problems, mostly in transport, location and scheduling fields. Firstly, we shall give a brief overview of the other meta-heuristics inspired by bees? foraging principles pointing out the differences between them. Then, we shall provide the detailed description of the BCO algorithm and its modifications, including the strategies for BCO parallelization, and giving the preliminary results regarding its convergence. The application survey is elaborated in Part II of our paper.
A Survey on the Applications of Bee Colony Optimization Techniques
—In this paper an overview of the areas where the Bee Colony Optimization (BCO) and its variants are applied have been given. Bee System was identified by Sato and Hagiwara in 1997 and the Bee Colony Optimization (BCO) was identified by Lucic and Teodorovic in 2001. BCO has emerged as a specialized class of Swarm Intelligence with bees as agents. It is an emerging field for researchers in the field of optimization problems because it provides immense problem solving scope for combinatorial and NP-hard problems. BCO is one of the benchmark systems portraying team work, collaborative work. BCO is a bottom-up approach of modeling where agents form global solution by optimizing the local solution.
Artificial Bee Colony Optimization— Population-Based Meta-Heuristic Swarm Intelligence Technique
Swarm Agents are known for their cooperative and collective behavior and operate in decentralized manner which is regarded as Swarm Intelligence. Various techniques like Ant Optimization, Wasp, Bacterial Foraging, PSO, etc., are proposed and implemented in various real-time applications to provide solutions to various real-time problems especially in optimization. The aim of this paper to present ABC algorithm in a comprehensive manner. The ABC-based SI technique proposed has demonstrated that it has superior edge in solving all types of unconstrained optimization problems. Many researchers have fine-tuned the basic algorithm and proposed different ABC based algorithms. The result show that still lots of work is required mathematically and live implementation in order to enable ABC algorithm to be applied to constrained problems for effective solutions.
An Overview of the Last Advances and Applications of Artificial Bee Colony Algorithm
Handbook of Research on Soft Computing and Nature-Inspired Algorithms
Swarm Intelligence is defined as collective behavior of decentralized and self-organized systems of a natural or artificial nature. In the last years and today, Swarm Intelligence has proven to be a branch of Artificial Intelligence that is able to solving efficiently complex optimization problems. Some of well-known examples of Swarm Intelligence in natural systems reported in the literature are colony of social insects such as bees and ants, bird flocks, fish schools, etc. In this respect, Artificial Bee Colony Algorithm is a nature inspired metaheuristic, which imitates the honey bee foraging behaviour that produces an intelligent social behaviour. ABC has been used successfully to solve a wide variety of discrete and continuous optimization problems. In order to further enhance the structure of Artificial Bee Colony, there are a variety of works that have modified and hybridized to other techniques the standard version of ABC. This work presents a review paper with a survey of t...
A modified artificial bee colony algorithm
Artificial bee colony algorithm (ABC) is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. Inspired by differential evolution (DE), we propose an improved solution search equation, which is based on that the bee searches only around the best solution of the previous iteration to improve the exploitation. Then, in order to make full use of and balance the exploration of the solution search equation of ABC and the exploitation of the proposed solution search equation, we introduce a selective probability P and get the new search mechanism. In addition, to enhance the global convergence, when producing the initial population, both chaotic systems and opposition-based learning methods are employed. The new search mechanism together with the proposed initialization makes up the modified ABC (MABC for short), which excludes the probabilistic selection scheme and scout bee phase. Experiments are conducted on a set of 28 benchmark functions. The results demonstrate good performance of MABC in solving complex numerical optimization problems when compared with two ABC-based algorithms.
Bee colony optimization: principles and applications
… Network Applications in …, 2006
Various natural systems lecture us that very simple individual organisms can create systems able to perform highly complex tasks by dynamically interacting with each other. The Bee Colony Optimization Metaheuristic (BCO) is proposed in this paper. The artificial bee colony behaves partially alike, and partially differently from bee colonies in nature. The agents use approximate reasoning and rules of fuzzy logic in their communication and acting. The BCO is capable to solve deterministic combinatorial problems, as well as combinatorial problems characterized by uncertainty.
Bee colony optimization for the p-center problem
Computers & Operations Research, 2011
Bee colony optimization (BCO) is a relatively new meta-heuristic designed to deal with hard combinatorial optimization problems. It is biologically inspired method that explores collective intelligence applied by the honey bees during nectar collecting process. In this paper we apply BCO to the p-center problem in the case of symmetric distance matrix. On the contrary to the constructive variant of the BCO algorithm used in recent literature, we propose variant of BCO based on the improvement concept (BCOi). The BCOi has not been significantly used in the relevant BCO literature so far. In this paper it is proved that BCOi can be a very useful concept for solving difficult combinatorial problems. The numerical experiments performed on well-known benchmark problems show that the BCOi is competitive with other methods and it can generate high-quality solutions within negligible CPU times.
The Bees Algorithm - A Novel Tool for Complex Optimisation Problems
A new population-based search algorithm called the Bees Algorithm (BA) is presented. The algorithm mimics the food foraging behaviour of swarms of honey bees. In its basic version, the algorithm performs a kind of neighbourhood search combined with random search and can be used for both combinatorial optimisation and functional optimisation. This paper focuses on the latter. Following a description of the algorithm, the paper gives the results obtained for a number of benchmark problems demonstrating the efficiency and robustness of the new algorithm.
Related papers
Honey Bees Inspired Optimization Method: The Bees Algorithm
Optimization algorithms are search methods where the goal is to find an optimal solution to a problem, in order to satisfy one or more objective functions, possibly subject to a set of constraints. Studies of social animals and social insects have resulted in a number of computational models of swarm intelligence. Within these swarms their collective behavior is usually very complex. The collective behavior of a swarm of social organisms emerges from the behaviors of the individuals of that swarm. Researchers have developed computational optimization methods based on biology such as Genetic Algorithms, Particle Swarm Optimization, and Ant Colony. The aim of this paper is to describe an optimization algorithm called the Bees Algorithm, inspired from the natural foraging behavior of honey bees, to find the optimal solution. The algorithm performs both an exploitative neighborhood search combined with random explorative search. In this paper, after an explanation of the natural foraging behavior of honey bees, the basic Bees Algorithm and its improved versions are described and are implemented in order to optimize several benchmark functions, and the results are compared with those obtained with different optimization algorithms. The results show that the Bees Algorithm offering some advantage over other optimization methods according to the nature of the problem.
A State-of-the-Art Review of Artificial Bee Colony in the Optimization of Single and Multiple Criteria
International Journal of Applied Metaheuristic Computing, 2013
Nowadays computers are used to solve a variety and multitude of complex problems facing in every sphere of peoples’ life. However, many of the problems are intractable in nature exact algorithm might need centuries to manage with formidable challenges. In such cases heuristic or in a broader sense meta-heuristic algorithms that find an approximate solution but have acceptable time and space complexity play indispensable role. In this article, the authors present a state-of-the-art review on meta-heuristic algorithm popularly known as artificial bee colony (ABC) inspired by honey bees. Moreover, the ABC algorithm for solving single and multi-objective optimization problems have been studied. A few potential application areas of ABC are highlighted as an end note of this article.
Bee Colony Optimization - part II: The application survey
Yugoslav Journal of Operations Research, 2014
Bee Colony Optimization (BCO) is a meta-heuristic method based on foraging habits of honeybees. This technique was motivated by the analogy found between the natural behavior of bees searching for food and the behavior of optimization algorithms searching for an optimum in combinatorial optimization problems. BCO has been successfully applied to various hard combinatorial optimization problems, mostly in transportation, location and scheduling fields. There are some applications in the continuous optimization field that have appeared recently. The main purpose of this paper is to introduce the scientific community more closely with BCO by summarizing its existing successful applications.
A honeybees-inspired heuristic algorithm for numerical optimisation
Neural Computing and Applications
Swarm intelligence is all about developing collective behaviours to solve complex, ill-structured and large-scale problems. Efficiency in collective behaviours depends on how to harmonise the individual contributors so that a complementary collective effort can be achieved to offer a useful solution. The main points in organising the harmony remain as managing the diversification and intensification actions appropriately, where the efficiency of collective behaviours depends on blending these two actions appropriately. In this paper, a hybrid bee algorithm is presented, which harmonises bee operators of two mainstream well-known swarm intelligence algorithms inspired of natural honeybee colonies. The parent algorithms have been overviewed with many respects, strengths and weaknesses are identified, first, and the hybrid version has been proposed, next. The efficiency of the hybrid algorithm is demonstrated in comparison with the parent algorithms in solving two types of numerical op...
A Generic Bee Colony Optimization Framework for Combinatorial Optimization Problems
2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation, 2010
this domain of scheduling with meta-heuristic. Being open-minded and helpful, they have provided me tonnes of suggestions, ideas and criticism. They also have given me enough freedom in my study. Their effectiveness in providing a comfortable and conducive research environment and the facilities in the Parallel Distributed Computing Center (PDCC) have eased my pursuit of knowledge. Besides, I am grateful for their encouragement to me in submitting papers about this research to various conferences and journals. Special thanks goes to the Universiti Sains Malaysia and the Ministry of Higher Education of Malaysia for the awarded scholarship, which provided me with financial security during the period of my PhD study. My thanks also goes to Professor Dr. Rosni
ARTIFICIAL BEE COLONY ALGORITHM, ITS VARIANTS AND APPLICATIONS: A SURVEY2 MOHAMMED AZMI AL-BETAR AND 1
Artificial Bee Colony Algorithm (ABC) is nature-inspired metaheuristic, which imitates the foraging behavior of bees. ABC as a stochastic technique is easy to implement, has fewer control parameters, and could easily be modify and hybridized with other metaheuristic algorithms. Due to its successful implementation, several researchers in the optimization and artificial intelligence domains have adopted it to be the main focus of their research work. Since 2005, several related works have appeared to enhance the performance of the standard ABC in the literature, to meet up with challenges of recent research problems being encountered. Interestingly, ABC has been tailored successfully, to solve a wide variety of discrete and continuous optimization problems. Some other works have modified and hybridized ABC to other algorithms, to further enhance the structure of its framework. In this review paper, we provide a thorough and extensive overview of most research work focusing on the application of ABC, with the expectation that it would serve as a reference material to both old and new, incoming researchers to the field, to support their understanding of current trends and assist their future research prospects and directions. The advantages, applications and drawbacks of the newly developed ABC hybrids are highlighted, critically analyzed and discussed accordingly.
Artificial bee colony algorithm, its variants and applications: A survey
Artificial Bee Colony Algorithm (ABC) is nature-inspired metaheuristic, which imitates the foraging behavior of bees. ABC as a stochastic technique is easy to implement, has fewer control parameters, and could easily be modify and hybridized with other metaheuristic algorithms. Due to its successful implementation, several researchers in the optimization and artificial intelligence domains have adopted it to be the main focus of their research work. Since 2005, several related works have appeared to enhance the performance of the standard ABC in the literature, to meet up with challenges of recent research problems being encountered. Interestingly, ABC has been tailored successfully, to solve a wide variety of discrete and continuous optimization problems. Some other works have modified and hybridized ABC to other algorithms, to further enhance the structure of its framework. In this review paper, we provide a thorough and extensive overview of most research work focusing on the app...
Analysis study of the bee algorithms as a mechanism for solving combinatorial problems
The Indonesian Journal of Electrical Engineering and Computer Science (IJEECS), 2023
Combinatorial optimization problems are problems that have a large number of discrete solutions and a cost function for evaluating those solutions in comparison to one another. With the vital need of solving the combinatorial problem, several research efforts have been concentrated on the biological entities behaviors to utilize such behaviors in population-based metaheuristic. This paper presents bee colony algorithms which is one of the sophisticated biological nature life. A brief detail of the nature of bee life has been presented with further classification of its behaviors. Furthermore, an illustration of the algorithms that have been derived from bee colony which are bee colony optimization, and artificial bee colony. Finally, a comparative analysis has been conducted between these algorithms according to the results of the traveling salesman problem solution. Where the bee colony optimization (BCO) rendered the best performance in terms of computing time and results.
Enhanced artificial bee colony optimization
International Journal of …, 2009
An enhanced Artificial Bee Colony (ABC) optimization algorithm, which is called the Interactive Artificial Bee Colony (IABC) optimization, for numerical optimization problems, is proposed in this paper. The onlooker bee is designed to move straightly to the picked coordinate indicated by the employed bee and evaluates the fitness values near it in the original Artificial Bee Colony algorithm in order to reduce the computational complexity. Hence, the exploration capacity of the ABC is constrained in a zone. Based on the framework of the ABC, the IABC introduces the concept of universal gravitation into the consideration of the affection between employed bees and the onlooker bees. By assigning different values of the control parameter, the universal gravitation should be involved for the IABC when there are various quantities of employed bees and the single onlooker bee. Therefore, the exploration ability is redeemed about on average in the IABC. Five benchmark functions are simulated in the experiments in order to compare the accuracy/quality of the IABC, the ABC and the PSO. The experimental results manifest the superiority in accuracy of the proposed IABC to other methods.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.