An Improved Artificial Bee Colony Algorithm Based on Gaussian Mutation and Chaos Disturbance

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.

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

Improved artificial bee colony algorithm with mutual learning

The artificial bee colony (ABC) algorithm is a biological‐inspired optimisation algorithm proposed by Karaboga. Since its solution search equation is good at exploration but poor at exploitation, the ABC algorithm converges slowly and is easy to fall into local optimum. Inspired by opposition‐based learning (OBL), the authors propose an improved ABC algorithm called opposition‐based learning ABC (OLABC). In OLABC, firstly, the population would be initialised using OBL. Secondly, to ensure the diversity of the population during the iterative process, the solution search equation is employed to bee phase would be improved. Generate the opposite solution when the fitness value of the newly generated solution is smaller than the current solution, and then apply the greedy selection strategy to update the solution. Thirdly, the adaptive weight strategy is used to dynamically adjust the weight, balancing the global exploration and local exploitation capabilities of the algorithm. Experiments on a set of benchmark functions show that OLABC has better convergence speed and optimisation precision than the compared algorithms.

Artificial Bee Colony (ABC) algorithm is the most popular add-on to class of swarm intelligence based meta-heuristic which is evolved to resolve the complex real world optimization problems. Most of the swarm intelligence based algorithms face the problem of stagnation, and premature convergence and ABC is not an exception. To reduce the chance of these problems as well as to control equilibrium between intensification and diversification capabilities of ABC, a unique variant of ABC is intended. In this intended variant, the employed bee stage, as well as onlooker bee stage of ABC algorithm is modified by taking inspiration from a local best candidate as well as the global best candidate. The intended ABC variant is named as Lbest Gbest ABC (LGABC) algorithm. The accuracy and efficiency of LGABC have examined over 12 benchmark functions and evaluated with the basic ABC, best so far ABC, Gbest ABC and Modified ABC and found that it may be an efficient contender in the field of swarm intelligence based algorithms.

The artificial bee colony (ABC) algorithm is an important branch of evolutionary algorithms and has been shown to be competitive with other algorithms for solving optimisation problems. However, there are always some insufficiencies in ABC algorithm such as lower convergence speed and easily get trapped in the local optima. To increase depth search capabilities of onlooker bees and ensure scout bees do not discard the current optimal solution, we proposed a modified ABC algorithm (denoted as ORABC) based on the optimisation strategy and retained strategy of the best individual in this paper. Compared with ABC algorithm, ABC* (added retained strategy to ABC) and ORABC algorithm, experiments are conducted on a set of numerical benchmark functions. The numerical simulation results demonstrate that ORABC algorithm improves the convergence characteristics of ABC algorithm and provides very remarkable performance in solving complex numerical optimisation problems compared to original algorithm.

As a relatively new paradigm of evolutionary algorithms, artificial bee colony (ABC) algorithm has shown attractive performance in solving optimization problems. However, for some complex optimization problems, its performance is still not satisfactory. To address this concerning issue, in this paper, we designed an improved ABC variant, called DLABC, based on the division of labor theory. In the DLABC, both of the employed bee phase and the onlooker bee phase are modified by introducing new solution search equations. For the modified employed bee phase, two new control parameters are introduced in the new solution search equation, which aims to control the frequency of perturbation and the magnitude of perturbation, respectively. For the modified onlooker bee phase, a novel depth-first search framework is used which tends to allocate more computing resources to elite solutions for accelerating convergence rate. By combing these two modified phases, we attempt to balance the exploration and exploitation capabilities of ABC. Numerical experiments are conducted on the CEC 2019 100-digit challenge benchmark suite, and the DLABC is compared with the basic ABC and a recently well-established ABC variant (DFSABC_elite). The total scores of these included algorithms have shown that our proposed DLABC algorithm performed best.

Data clustering is one of the branches of unsupervised learning and it is a process whereby the samples are divided into categories whose members are similar to each other. The K-means algorithm is a simple and fast clustering technique, but it has many initial problems, for example, it depends heavily on the initial value for better clustering. Moreover, it is susceptible to outliers and unbalanced clusters. The artificial bee colony (ABC) algorithm is one of the meta-heuristic algorithms that is used nowadays to solve many optimization problems including clustering and the fundamental problem of this algorithm is exploration and late convergence. In this paper, to solve the problem of exploration and late convergence in ABC are used Random Memory (RM) and Elite Memory (EM) called ABCWOA algorithm. RM in the ABCWOA algorithm has used the search stage for the bait in the whale optimization algorithm (WOA) and EM is also used to increase convergence. In addition, we control the use of EM dynamically. Finally, the proposed method was implemented on ten standard datasets from the UCI Machine Learning Database for evaluation. Moreover, it was compared in terms of statistical criteria and analysis of variance (ANOVA) test with basic ABC and WOA, vortex search (VS) algorithm, butterfly optimization algorithm (BOA), crow search (CS) algorithm, and cuckoo search algorithm (CSA). The simulation results showed that the degree of convergence maintained its performance by increasing the number of repetitions of the proposed method, but the ABC algorithm has shown poor performance by increasing the repetition of performance. ANOVA results also confirmed that the ABCWOA algorithm has a positive effect on the population and it contains less noise than other comparative algorithms. The ABCWOA algorithm show that the ABCWOA algorithm performs better than other meta-heuristic algorithms.

Artificial bee colony (ABC) algorithm has been proven to be an effective swarm intelligence-based algorithm to solve various numerical optimization problems. To improve the exploration and exploitation capabilities of ABC algorithm a new phase, namely disruption phase is introduced in the basic ABC. In disruption phase, disrupted operator in which the solutions are attracted or disrupted from the best solution based on the their respective distance from the best solution, is applied to all the solutions except the best solution. Further, the proposed strategy has been evaluated on 15 different benchmark functions and compared with basic ABC and two of its variants, namely modified ABC (MABC) and best so for ABC (BSFABC).

The Improved Artificial Bee Colony (IABC) algorithm is a variant of the well-known Artificial Bee Colony (ABC) algorithm. In IABC, a new initialization approach and a new search mechanism were added to the ABC for avoiding local optimums and a better convergence speed. New parameters were added for the new search mechanism. Specified values of these newly added parameters have a direct impact on the performance of the IABC algorithm. For better performance of the algorithm, parameter values should be subjected to change from problem to problem and also need to be updated during the run of the algorithm. In this paper, two novel parameter control methods and related algorithms have been developed in order to increase the performance of the IABC algorithm for large scale optimization problems. One of them is an adaptive parameter control which updates parameter values according to the feedback coming from the search process during the run of the algorithm. In the second method, the management of the parameter values is left to the algorithm itself, which is called self-adaptive parameter control. The adaptive IABC algorithms were examined and compared to other ABC variants and state-of-the-art algorithms on a benchmark functions suite. Through the analysis of the results of the experiments, the adaptive IABC algorithms outperformed almost all ABC variants and gave competitive results with state-of-the-art algorithms from the literature.

Swarm intelligence is briefly defined as the collective behavior of decentralized and self-organized swarms. Self-organization and labor division are the two key components of swarm intelligence. Artificial Bee Colony (ABC) algorithm is one of the most recent swarm intelligence-based algorithms. The behavior of bees in ABC algorithm satisfies the self-organization features, but there is no specific labor division mechanism in ABC algorithm. In this work, we propose an improved ABC algorithm called labor division artificial bee colony (LDABC) algorithm by incorporating the labor division mechanism into ABC algorithm, which is achieved by individual specialization and role plasticity. We specify three different search methods for employed bees, onlooker bees and scout bees to realize individual specialization, these search methods are related to food source quality, enable bees to maximize exploitation of food source. Role plasticity is achieved by combining with cellular automata, where the roles of bees are not static but vary with their surrounding environment, enable bees not to limit to one search method. The different search modes and the flexibility of the search behaviors make our algorithm achieve a better balance between exploration and exploitation. The experimental results tested on 13 benchmark functions and CEC-2013 test functions demonstrate a competitive performance.

In this dissertation, three different evolutionary algorithms are proposed by hybridizing the Taguchi method, chaos disturbance method, multilevel immune algorithm (MIA), clonal selection algorithm (CLONALG), and artificial bee colony algorithm (ABC). Including multi-level immune algorithm and clonal selection algorithm is derived by the immune algorithm. These algorithms are thus called HTCMIABC, HTCABC, and HCABC. The HTCMIABC comprises two main different phases. We use the MIA as the recognition phase to balance local and global search and accelerate the search speed to enhance the evolutionary phase. Second, the evolutionary phase is built on the ABC and chaos disturbance operation to have the capabilities of exploration and exploitation. Moreover, the Taguchi method and crossover operation are inserted between the recognition phase and evolutionary phase for the recombination and diversification of several antibodies to improve the searching ability. In the HTCABC, the chaos search algorithm and adaptive bound method are adopted to improve the ABC performance. Then, the Taguchi method and crossover operation are incorporated into the chaos artificial bee colony (CABC) to accelerate the search capacity. Moreover, the natural phenomenon of the elite strategy is adopted and the recruitment of new scout bees is used for HTCABC, which can maintain the diversity of the population, and escape from local optima. Additionally, there is no complex parameter setting in the algorithm design. In the HCABC, the mutation mechanism of the CLONALG by using the advantages of ABC can improve the capabilities of exploration and exploitation. Finally, the HTCMIABC algorithm is examined by parameter identification of nonlinear chaotic system. Simulation results show that the HTCMIABC is more efficient than some typical existing algorithms. The HTCABC algorithm is examined by using a set of benchmarks and the proposed approach is also applied to solve the parameter identification of a chaotic system. Simulation results show that the HTCABC is more efficient than some existing algorithms reported in the literature. In addition, the simulation results also demonstrate that HCABC can effectively achieve the best PID-like fuzzy controller structure and parameters.

Optimization of blockchain investment portfolio under artificial bee colony algorithm

Artificial Bee Colony (ABC) is one of the latest and emerging swarm intelligence algorithms. Though, there are some areas where ABC works better than other optimization techniques but, the drawbacks like stucking at local optima and preferring exploration at the cost of exploitation, are also associated with it. This paper uses position update equation in ABC as in Gbest-guided ABC (GABC) and attempts to improve ABC algorithm by balancing its exploration and exploitation capabilities. The proposed algorithm is named as Expedited Artificial Bee Colony (EABC). We altered the onlooker bee phase of ABC by forcing the individual bee to take positive direction towards the random bee if this selected random bee has better fitness than the current bee and if it is not the case then the current bee will move in reverse direction. In this way, ABC colony members will not follow only global best bee but also a random bee which has better fitness than the current bee which is going to be modified. So the mentioned drawbacks of the ABC may be resolved. To analyze the performance of the proposed modification, 14 unbiased benchmark optimization functions have been considered and experimental results reflect its superiority over the Basic ABC and GABC.

The artificial bee colony (ABC) algorithm is developed by D. Karaboga. Various researchers proved that the performance of ABC is better than other competitive algorithms, but it has some drawbacks like early convergence and stagnation. The ABC performs very well while exploring the feasible search space, but it shows poor performance for exploitation. To overcome this drawback, this paper proposed a variant of ABC, namely Arrhenius ABC (aABC) algorithm using the concept of Arrhenius equation. The aim of this paper is to improve balancing between exploration and exploitation capability of ABC. In order to check the performance of aABC, it is applied to solve the robot path planning problem. The performance of aABC compared with well-known nature-inspired algorithms like differential evolution, particle swarm optimization, and basic ABC. The aABC algorithm performs better than the other considered algorithms while solving robot path planning problem.