Basic Artificial Bee Colony Algorithm Research Articles

Prediction of compressive strength of concrete based on improved artificial bee colony-multilayer perceptron algorithm

There are many factors that affect the compressive strength of concrete. The relationship between compressive strength and these factors is a complex nonlinear problem. Empirical formulas commonly used to predict the compressive strength of concrete are based on summarizing experimental data of several different mix proportions and curing periods, and their generality is poor. This article proposes an improved artificial bee colony algorithm (IABC) and a multilayer perceptron (MLP) coupled model for predicting the compressive strength of concrete. To address the shortcomings of the basic artificial bee colony algorithm, such as easily falling into local optima and slow convergence speed, this article introduces a Gaussian mutation operator into the basic artificial bee colony algorithm to optimize the initial honey source position and designs an MLP neural network model based on the improved artificial bee colony algorithm (IABC-MLP). Compared with traditional strength prediction models, the ABC-MLP model can better capture the nonlinear relationship of the compressive strength of concrete and achieve higher prediction accuracy when considering the compound effect of multiple factors. The IABC-MLP model built in this study is compared with the ABC-MLP and particle swarm optimization (PSO) coupling algorithms. The research shows that IABC can significantly improve the training and prediction accuracy of MLP. Compared with the ABC-MLP and PSO-MLP coupling models, the training accuracy of the IABC-MLP model is increased by 1.6% and 4.5%, respectively. This model is also compared with common individual learning algorithms such as MLP, decision tree (DT), support vector machine regression (SVR), and random forest algorithms (RF). Based on the comparison of prediction results, the proposed method shows excellent performance in all indicators and demonstrates the superiority of heuristic algorithms in predicting the compressive strength of concrete.

An artificial bee colony algorithm with a cumulative covariance matrix mechanism and its application in parameter optimization for hearing loss detection models

Artificial bee colony (ABC) algorithms which are applied to various complex problems for their competitive performance and simple structures are a relatively popular paradigm of evolutionary algorithms (EAs). Although many variants based on the basic ABC algorithm have been developed, most variants have limited performance on non-separable problems. This is mainly because these variants usually focus on only individual quality information, but neglect population distribution information. To address this limitation, in this paper, we propose a new ABC with a cumulative covariance matrix mechanism (CCoM-ABC), in which the population distribution information in all previous generations is involved to guide the evolution process. Specifically, the CCoM-ABC algorithm applies a cumulative covariance matrix (CCoM) mechanism by which the population information of every generation is involved to improve the probability of finding the optimum. It also applies an adaptive selection mechanism by which the proper coordinate system used to generate candidate solutions can be dynamically selected between a natural one and an eigen one during the search process. Furthermore, for improving the search ability, a new search equation is adopted in the scout bees phase. A series of experiments are conducted on the CEC2014 to evaluate the performance of the proposed CCoM-ABC algorithm, and the results show that the CCoM-ABC outperforms state-of-the-art ABC variants and EAs in terms of convergence speed, solution accuracy, and numerical scalability. For validating the practicality of the proposed CCoM-ABC algorithm, we further apply it to optimize the parameters of the neural network for hearing loss (HL) detection. This study involves 60 brain images consisting of 20 left-sided HL, 20 right-side HL, and 20 healthy control images. The results show that this model outperforms state-of-the-art related methods in terms of overall accuracy by about 2%.

Optimization of PID trajectory tracking controller for a 3-DOF robotic manipulator using enhanced Artificial Bee Colony algorithm

This study introduces and compares two optimization techniques, the basic Artificial Bee Colony (ABC) and the enhanced Artificial Bee Colony with multi-elite guidance (MGABC), for determining optimal gains of a Proportional-Integral-Derivative (PID) controller in a 3 degrees of freedom (DOF) rigid link manipulator (RLM) system. The objective function used in the optimization process is a novel function that is based on the well-known Lyapunov stability functions. This function is evaluated against established error-based objective functions commonly used in control systems. The convergence curves of the optimization process demonstrate that the MGABC algorithm outperforms the basic ABC algorithm by effectively exploring the search space and avoiding local optima. The evaluation of the controller's performance in trajectory tracking reveals the superiority of the Lyapunov-based objective function (LBF), with significant improvements over other objective functions such as IAE, ISE, ITAE, MAE and MRSE. The optimized system demonstrates robustness to diverse disturbance conditions and uncertainty in the mass of the payload, while also exhibiting adaptability to joints flexibility without inducing any vibrations in the movement of the end-effector. The proposed techniques and objective function offer promising avenues for the optimization of PID controllers in various robotic applications.

On the Application of Quick Artificial Bee Colony Algorithm (qABC) for Attenuation of Test Suite in Real-Time Software Applications

Software testing plays a vital role during the software development process, as it ensures quality software deployment. Success of software testing depends on the design of effective test cases. To achieve the optimization of generated test cases, the proposed approach combines both global and local searches by means of intelligent agents which exhibit the behaviour of employed bees, onlooker bees, and scout bees in the qABC algorithm. The proposed qABC algorithm has key improvements over the basic artificial bee colony algorithm (ABC) in test optimization by reducing redundancy, filtering of test cases in each iteration and parallel working of the bees. Further, the fitness evaluation of the test cases is done by employing two test adequacy metrics namely path coverage and mutation score. Further, the experimental evaluation of qABC, GA, and the basic ABC based test cases is done using several case study applications. The result shows that qABC outperforms the other algorithms in terms of effectiveness of test cases in revealing the faults with less time and a smaller number of test cases.

A discrete artificial bee colony algorithm for quadratic assignment problem

The quadratic assignment problem (QAP) is a well-known challenging combinational optimization problem that has received many researchers’ attention with varied real-world and industrial applications areas. Using the framework of basic artificial bee colony algorithm, frequently used crossover and mutation operators, and combined with an effective local search method, this paper proposes a simple but effective discrete artificial bee colony (DABC) algorithm for solving quadratic assignment problems (QAPs). Typical QAP benchmark instances are selected from QAPLIB in order to conduct the simulation experiment where common performance metrics are used to evaluate the algorithm. The paper also investigates the influence factors of the algorithm’s performance. The results show that the proposed algorithm is a quite effective and practical new approach for handling QAP problems.

A self-adaptive level-based learning artificial bee colony algorithm for feature selection on high-dimensional classification

Feature selection is an important data preprocessing method in data mining and machine learning, yet it faces the challenge of “curse of dimensionality” when dealing with high-dimensional data. In this paper, a self-adaptive level-based learning artificial bee colony (SLLABC) algorithm is proposed for high-dimensional feature selection problem. The SLLABC algorithm includes three new mechanisms: (1) A novel level-based learning mechanism is introduced to accelerate the convergence of the basic artificial bee colony algorithm, which divides the population into several levels and the individuals on each level learn from the individuals on higher levels, especially, the individuals on the highest level learn from each other. (2) A self-adaptive method is proposed to keep the balance between exploration and exploitation abilities, which takes the diversity of population into account to determine the number of levels. The lower the diversity is, the fewer the levels are divided. (3) A new update mechanism is proposed to reduce the number of selected features. In this mechanism, if the error rate of an offspring is higher than or is equal to that of its parent but selects more features, then the offspring is discarded and the parent is retained, otherwise, the offspring replaces its parent. Further, we discuss and analyze the contribution of these novelties to the diversity of population and the performance of classification. Finally, the results, compared with 8 state-of-the-art algorithms on 12 high-dimensional datasets, confirm the competitive performance of the proposed SLLABC on both classification accuracy and the size of the feature subset.

Dynamic Artificial Bee Colony Algorithm with Hybrid Initialization Method

An improved basic artificial bee colony (ABC) algorithm with a self-adaptive technique, called dynamic ABC, is proposed. The dynamic ABC algorithm first uses a hybrid method combining the good-point-set method with the chaotic maps method to generate the initial population. Then, it applies self-adaptive population size at each generation, meaning that the population increases or decreases depending on some criteria, to enhance global convergence and avoiding local solutions. Experiments are carried out on a range of 10 popular benchmark functions. The results indicate that the dynamic ABC algorithm is superior to the basic ABC algorithm when considering both the speed and quality of the solution obtained.

Effects of memory and genetic operators on Artificial Bee Colony algorithm for Single Container Loading problem

The Artificial Bee Colony (ABC) algorithm is widely used to achieve optimum solution in a short time in integer-based optimization problems. However, the complexity of integer-based problems such as Knapsack Problems (KP) requires robust algorithms to avoid excessive solution search time. ABC algorithm that provides both the exploitation and the exploration approach is used as an alternative approach for various KP problems in the literature. However, it is rarely used for the Single Container Loading problem (SCLP) which is an important part of the transportation systems. In this study, the exploitation and exploration aspects of the ABC algorithm are improved by using memory mechanisms and genetic operators to develop three different hybrid ABC algorithms. The developed algorithms and the basic ABC algorithm are applied to a SCLP dataset from the literature to observe the effects of the memory mechanism and the genetic operators separately. Besides, a joint hybrid ABC algorithm using both reinforcement approaches is proposed to solve the SCLP. The results show that the joint hybrid ABC algorithm has emerged as a promising approach to solving SCLP with an average performance, and the genetic operators are more effective than the memory mechanism to develop a hybrid ABC algorithm.

Archive-based multi-criteria Artificial Bee Colony algorithm for whole test suite generation

Testing an object-oriented software is harder than testing a structural program due to inheritance, states, behaviour of different objects, association, and polymorphism properties of the object-oriented software, which is established based on classes. The classes should be carefully tested using predefined test cases to optimize coverage goals. Because generating test cases manually is labour-intensive, search-based software testing methods that maximize coverage criteria by a search algorithm can be used to generate test cases automatically. Artificial Bee Colony (ABC) algorithm is a powerful search tool that performs balanced exploration and exploitation. In this study, two new multi-criteria and combinatorial ABC algorithms using mutation and crossover operators are proposed to generate a test suite that maximizes a fitness function combining various goals for object-oriented software. First, an archive-based ABC algorithm is proposed to keep covered targets in the archive to use available search resource efficiently. Second, the archive-based ABC algorithm is improved to bring more diversity in the population. To investigate the effect of the archive, the basic ABC algorithm and the archive-based ABC algorithms are compared on a set of classes from SF110 corpus. To validate efficiency of the proposed methods, they are compared to state-of-the-art evolutionary test suite generators and random testing methodology on the classes divided into difficulty levels based on their weight method class values. The experimental results reveal that introducing an archive into the ABC algorithm provides fast convergence compared to the basic ABC and the improved archive-based ABC produces higher coverage for the problems with both low and high difficulty levels.

Research on PID Parameter Tuning Based on Improved Artificial Bee Colony Algorithm

Aiming at the difficulty of tuning industrial PID control parameters, an improved artificial bee colony PID tuning method is proposed. The improved artificial bee colony algorithm (IABC) uses Boltzmann selection mechanism to avoid premature convergence of roulette mechanism; at the same time, the global crossover mechanism is introduced in the domain search, which enhances the direction of the algorithm; and through chaotic avoiding search, the diversity of population is increased and the ability of global search is improved. Finally, the IABC algorithm is applied to PID parameter optimization of second order system. The simulation results show that the IABC algorithm obtains smaller ITAE and adjustment time than the basic artificial bee colony algorithm and Ziegler-Nichols engineering tuning method, and there is no overshoot. The performance of IABC algorithm is obviously improved.

Multi-cognitive network resource allocation based on improved artificial bee colony algorithm

This paper introduces a graph theory model for resource allocation in multi-cognitive wireless network scenarios. Aiming at the problems of low search accuracy and slow convergence speed of the basic artificial bee colony algorithm, an improved bee colony algorithm is proposed. The improved algorithm introduces an adaptive t-distribution mutation strategy. Compared with the original algorithm, the performance of the improved algorithm has greatly improved. At the same time, the improved bee colony algorithm is applied to multi-cognitive wireless network scenarios for resource allocation in the model. The experimental results show that the improved artificial bee colony algorithm can obtain greater system throughput and effectively reduce the performance of multi-cognitive wireless network systems, and can allocate resources more reasonably.

An improved exhausted-food-sources-identification mechanism for the artificial bee colony algorithm

Artificial bee colony (ABC) algorithm has been widely used to solve the optimization problems. In the existing ABC algorithms, choosing which employed bee giving up its food source only based on its current trial number. It may cause some promising areas are exploited insufficiently and some non-significant areas are searched excessively, which leads to a waste of much more searching resources. To cope with this problem, an improved exhausted food source identification mechanism based on space partitioning is designed, which considers the food source states both in the objective space and searching space simultaneously. Then, the proposed mechanism is applied to the basic ABC algorithm and a recently improved ABC algorithm. The experimental results have demonstrated that the ABC algorithms with the designed exhausted food source identification mechanism perform better than the original ABC algorithms in almost all the functions on the CEC2015 test suit.

Improved artificial bee colony algorithm based on escaped foraging strategy

ABSTRACTThis paper presents an improved artificial bee colony algorithm. Under the framework of the basic artificial bee colony algorithm, this paper redefines the artificial bee colony and introduces search strategies for group escape and foraging based on Levy flight. The proposed algorithm is named artificial bee colony algorithm based on escaped foraging strategy (EFSABC).There are different strategies for scout bees, onlookers, and free bees searching for honey sources in the EFSABC: all working bees relinquish old honey sources due to disturbance, and select different routines to seek new honey sources. Sixteen typical high-dimensional standard functions are used to verify the effectiveness of the proposed algorithm. The EFSABC algorithm outperforms the traditional artificial bee colony algorithm in all aspects.

Artificial Bee Colony algorithm with improved search mechanism

In a preceding study, authors critically analysed the functional behaviour of Artificial Bee Colony (ABC) algorithm in view of some of its reported search limitations and offered directions for performance improvements. Accordingly, an improved ABC (IABC) algorithm is proposed with inclusion of three features: (1) dynamic update of probability values of food sources after every successful new search under the onlooker bees operator, (2) Allocation of variable ‘effective limit’ to each food source based upon its food quality instead of global fixed ‘limit’ and (3) insulation of best-so-far solution from scout bee operator. The additional features render substantial improvements in search abilities of ABC algorithm. The experiments with classical and CEC’2014 benchmark test functions confirm the supremacy of IABC algorithm over basic ABC algorithm as well as some of its variants and other evolutionary algorithms. Notably, the IABC algorithm does not introduce any new control parameter or hybridization with any other operator and maintains almost same level of computational complexity.

Best neighbor-guided artificial bee colony algorithm for continuous optimization problems

As a relatively recent invented swarm intelligence algorithm, artificial bee colony (ABC) becomes popular and is powerful for solving the tough continuous optimization problems. However, the weak exploitation has greatly affected the performance of basic ABC algorithm. Meanwhile, keeping a proper balance between the exploration and exploitation is critical work. To tackle these problems, this paper introduces a best neighbor-guided ABC algorithm, named NABC. In NABC, the best neighbor-guided solution search strategy is proposed to equilibrate the exploration and exploitation of new algorithm during the search process. Moreover, the global neighbor search operator has displaced the original random method in the scout bee phase aiming to preserve the search experiences. The experimental studies have been tested on a set of widely used benchmark functions (including the CEC 2013 shifted and rotated problems) and one real-world application problem (the software defect prediction). Experimental results and comparison with the state-of-the-art ABC variants indicate that NABC is very competitive and outperforms the other algorithms.

A Developed Artificial Bee Colony Algorithm Based on Cloud Model

The Artificial Bee Colony (ABC) algorithm is a bionic intelligent optimization method. The cloud model is a kind of uncertainty conversion model between a qualitative concept T ˜ that is presented by nature language and its quantitative expression, which integrates probability theory and the fuzzy mathematics. A developed ABC algorithm based on cloud model is proposed to enhance accuracy of the basic ABC algorithm and avoid getting trapped into local optima by introducing a new select mechanism, replacing the onlooker bees’ search formula and changing the scout bees’ updating formula. Experiments on CEC15 show that the new algorithm has a faster convergence speed and higher accuracy than the basic ABC and some cloud model based ABC variants.

Groundwater management using a new coupled model of meshless local Petrov-Galerkin method and modified artificial bee colony algorithm

To develop sustainable groundwater management strategies, generally coupled simulation-optimization (SO) models are used. In this study, a new SO model is developed by coupling moving least squares (MLS)-based meshless local Petrov-Galerkin (MLPG) method and modified artificial bee colony (MABC) algorithm. The MLPG simulation model utilizes the advantages of meshless methods over the grid-based techniques such as finite difference (FDM) and finite element method (FEM). For optimization, the basic artificial bee colony algorithm is modified to balance the exploration and exploitation capacity of the model more effectively. The performance of the developed MLPG-MABC model is investigated by applying it to hypothetical and field problems with three different management scenarios. The model results are compared with other available SO model solutions for its accuracy. Further, sensitivity analyses of various model parameters are carried out to check the robustness of the SO model. The proposed model gave quite promising results, showing the applicability of the present approach.

REDUCTION OF ACTIVE POWER LOSS BY CHAOTIC SEARCH BASED ARTIFICIAL BEE COLONY ALGORITHM

This paper presents Chaotic Search Based Artificial Bee Colony Optimization Algorithm (CSABC) for solving the optimal reactive power problem. Basic Artificial Bee Colony algorithm (ABC) has the advantages of strong robustness, fast convergence and high flexibility, fewer setting parameters, but it has the disadvantages premature convergence in the later search period and the accuracy of the optimal value which cannot meet the requirements sometimes. In this paper the Chaotic Local Search method is applied to solve the reactive power problem of global optimal value. The premature convergence issue of the Artificial Bee Colony algorithm has been improved by increasing the number of scout and rational using of the global optimal value and Chaotic Search. The proposed Chaotic Search Based Artificial Bee Colony Optimization (CSABC) algorithm has been tested in stand IEEE 30, 118- bus & practical 191 Indian utility test systems. The results show that the proposed algorithm performs well in reducing the real power loss and prevent premature convergence to high degree with rapid convergence.

Multimodal optimization by using hybrid of artificial bee colony algorithm and BFGS algorithm

Optimization has become one of the important fields in Mathematics. Many problems in engineering and science can be formulated into optimization problems. They maybe have many local optima. The optimization problem with many local optima, known as multimodal optimization problem, is how to find the global solution. Several metaheuristic methods have been proposed to solve multimodal optimization problems such as Particle Swarm Optimization (PSO), Genetics Algorithm (GA), Artificial Bee Colony (ABC) algorithm, etc. The performance of the ABC algorithm is better than or similar to those of other population-based algorithms with the advantage of employing a fewer control parameters. The ABC algorithm also has the advantages of strong robustness, fast convergence and high flexibility. However, it has the disadvantages premature convergence in the later search period. The accuracy of the optimal value cannot meet the requirements sometimes. Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm is a good iterative method for finding a local optimum. Compared with other local optimization methods, the BFGS algorithm is better. Based on the advantages of the ABC algorithm and the BFGS algorithm, this paper proposes a hybrid of the artificial bee colony algorithm and the BFGS algorithm to solve the multimodal optimization problem. The first step is that the ABC algorithm is run to find a point. In the second step is that the point obtained by the first step is used as an initial point of BFGS algorithm. The results show that the hybrid method can overcome from the basic ABC algorithm problems for almost all test function. However, if the shape of function is flat, the proposed method cannot work well.

Satellite formation keeping via chaotic artificial bee colony

PurposeKeeping satellite position within close tolerances is key for the utilization of satellite formations for space missions. The presence of perturbation forces makes control inevitable if such mission objective is to be realised. Various approaches have been used to obtain feedback controller parameters for satellites in a formation; this paper aims to approach the problem of estimating the optimal feedback parameter for a leader–follower pair of satellites in a small eccentric orbit using nature-based search algorithms.Design/methodology/approachThe chaotic artificial bee colony algorithm is a variant of the basic artificial bee colony algorithm. The algorithm mimics the behaviour of bees in their search for food sources. This paper uses the algorithm in optimizing feedback controller parameters for a satellite formation control problem. The problem is formulated to optimize the controller parameters while minimizing a fuel- and state-dependent cost function. The dynamical model of the satellite is based on Gauss variational equations with J2 perturbation. Detailed implementation of the procedure is provided, and experimental results of using the algorithm are also presented to show feasibility of the method.FindingsThe experimental results indicate the feasibility of this approach, clearly showing the effective control of the transients that arise because of J2 perturbation.Originality/valueThis paper applied a swarm intelligence approach to the problem of estimating optimal feedback control parameter for a pair of satellites in a formation.