Optimization of blockchain investment portfolio under artificial bee colony algorithm

Improved artificial bee colony algorithm with mutual learning

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 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.

INTRODUCTION: The artificial bee colony (ABC) algorithm is a nature-inspired technique used for solving different optimization problems. This paper presents a multi-hive ABC algorithm for solving constrained benchmark functions of CEC2006. The CEC2006 data set contains the global benchmark functions with different design variables, number and type of constraints. OBJECTIVES: The objective of the proposed work is to design and apply the GPGPU based multi-hive ABC algorithm to solve constrained optimization problems. METHODS: The proposed approach is a multi-population coarse-grained system implemented using General Purpose Graphics Processing Unit (GPGPU). The performance of the proposed approach is compared with the serial ABC algorithm for eleven benchmark functions and results in the literature. The multi-hive ABC algorithm has multiple hives, each running separate ABC algorithm on different cores of GPGPU. RESULTS: The proposed approach provides global best solutions in significantly reduced time for all benchmark functions. The speed-up obtained is approximately 7X to 9X. The GPGPU device utilization is approximately 57% to 91%. CONCLUSION: The GPGPU based multi-hive ABC algorithm is a found good with respect to best results, speed up factor and GPU utilization to solve constrained optimization problems.

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.

Gbest-guided artificial bee colony algorithm for numerical function optimization

Aiming at the resource optimization problem in the cooperative detection task, the objective function is constructed based on the channel capacity, and the artificial bee colony (ABC) algorithm is improved to realize the joint optimization of the UAV swarm trajectory and radiation power. Firstly, a multiple input multiple output (MIMO) cooperative detection model is constructed. Then, based on the perspective of information theory, the channel capacity of the cooperative detection model is derived and used as the objective function for optimizing the detection resources of UAV swarm. Then, the factors affecting the objective function are sorted out and analyzed one by one, and the constraints are clarified. Aiming at the shortcomings of ABC algorithm, its search strategy and parameter optimization method are improved. A joint optimization process of UAV swarm trajectory and radiated power based on improved ABC algorithm is constructed. Finally, through simulation verification and algorithm comparison, it shows that the algorithm in this paper can improve the perception ability of cooperative detection of UAV swarm.

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.

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.

PurposeThe purpose of this paper is to use an ABC algorithm to improve the thrust–torque ratio of a rotating-wing unmanned aerial vehicle (UAV) model.Design/methodology/approachThe design of UAVs, such as aircraft, drones, helicopters, has become one of the popular engineering areas with the development of technology. This study aims to improve the value of thrust–torque ratio of an unmanned helicopter. For this purpose, an unmanned helicopter was built at the Faculty of Aeronautics and Astronautics, Erciyes University. The maximum thrust–torque ratio was calculated considering the blade length, blade chord width, blade mass density and blade twist angle. For calculation, artificial bee colony (ABC) algorithm was used. By using ABC algorithm, the maximum thrust–torque ratio was obtained against the optimum input values. For this purpose, a model with four inputs and a single output is formed. In the generated system model, optimum thrust–torque ratio was calculated by changing the input values used in the ±5% range. As a result of this study, approximately 31% improvement was achieved. According to these results, the proposed approach will provide convenience to the designers in the design of the rotating-wing UAV.FindingsAccording to these results, approximately 31% improvement was achieved, and the proposed approach will provide convenience to the designers in the design of the rotating-wing UAV.Research limitations/implicationsIt takes a long time to obtain the optimum thrust–torque ratio value through the ABC algorithm method.Practical implicationsUsing ABC algorithm provides to improve the value of thrust–torque ratio of an unmanned helicopter. With this algorithm, unmanned helicopter flies more than ever. Thus, the presented method based on the ABC algorithm is more efficient.Social implicationsThe application of the ABC algorithm method can be used effectively to calculate the thrust–torque ratio in UAV.Originality/valueProviding an original and penetrating a method that saves time and reduces the cost to improve the value of thrust–torque ratio of an unmanned helicopter.

A self adaptive hybrid enhanced artificial bee colony algorithm for continuous optimization problems

The artificial bee colony (ABC) algorithm, which was inspired by the foraging and dance behaviors of real honey bee colonies, was first introduced for solving numerical optimization problems. When the solution space of the optimization problem is binary-structured, the basic ABC algorithm should be modified for solving this class of problems. In this study, we propose XOR-based modification for the solution-updating equation of the ABC algorithm in order to solve binary optimization problems. The proposed method, named binary ABC (binABC), is examined on an uncapacitated facility location problem, which is a pure binary optimization problem, and the results obtained by the binABC are compared with results obtained by binary particle swarm optimization (BPSO), the discrete ABC (DisABC) algorithm, and improved BPSO (IBPSO). The experimental results show that binABC is an alternative tool for solving binary optimization problems and is a competitive algorithm when compared with BPSO, DisABC, and IBPSO in terms of solution quality, robustness, and simplicity.

Artificial Bee Colony (ABC) algorithm inspired by the complex search and foraging behaviors of real honey bees is one of the most promising implementations of the Swarm Intelligence- (SI-) based optimization algorithms. Due to its robust and phase-divided structure, the ABC algorithm has been successfully applied to different types of optimization problems. However, some assumptions that are made with the purpose of reducing implementation difficulties about the sophisticated behaviours of employed, onlooker, and scout bees still require changes with the more literal procedures. In this study, the ABC algorithm and its well-known variants are powered by adding a new control mechanism in which the decision-making process of the employed bees managing transitions to the dance area is modeled. Experimental studies with different types of problems and analysis about the parallelization showed that the newly proposed approach significantly improved the qualities of the final solutions and convergence characteristics compared to the standard implementations of the ABC algorithms.

The continuous artificial bee colony algorithm for binary optimization

Based on the coupled vertical-torsional free vibration records of the spring-suspended section model of bridge decks, an improved Artificial Bee Colony (ABC) algorithm is proposed to identify the flutter derivatives. The ABC algorithm is a novel biological-inspired optimization algorithm, comparing with other iteration methods, the ABC algorithm can facilitate the identification process with no need for initial value. The standard ABC algorithm is good at exploration but poor at exploitation. To enhance the exploitation of the ABC algorithm, Powell’s method is used as a local search tool and a nonlinear factor is introduced for convergence control. Search equations applied to generate candidate solutions in the onlookers and scout bees phase are modified to improve the search ability of this method. The objective function in the optimization is weighted residual sum of squares between measured records and predicted values, where the weighting factors are optimized by an iteration process. The modified ABC algorithm is tested on several benchmark functions compared with the standard ABC algorithm. Simulation results show that the proposed algorithm has a higher convergence speed, better solution quality and stronger robustness. In order to investigate the effectiveness of the modified ABC algorithm in the flutter derivatives identification, numerical simulations of an ideal thin-plate model are carried out. The identification results show that the modified ABC algorithm for flutter derivatives identification of bridge decks is robust and reliable.