scholarly journals A Multistrategy Optimization Improved Artificial Bee Colony Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Wen Liu

Being prone to the shortcomings of premature and slow convergence rate of artificial bee colony algorithm, an improved algorithm was proposed. Chaotic reverse learning strategies were used to initialize swarm in order to improve the global search ability of the algorithm and keep the diversity of the algorithm; the similarity degree of individuals of the population was used to characterize the diversity of population; population diversity measure was set as an indicator to dynamically and adaptively adjust the nectar position; the premature and local convergence were avoided effectively; dual population search mechanism was introduced to the search stage of algorithm; the parallel search of dual population considerably improved the convergence rate. Through simulation experiments of 10 standard testing functions and compared with other algorithms, the results showed that the improved algorithm had faster convergence rate and the capacity of jumping out of local optimum faster.

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Lijun Sun ◽  
Tianfei Chen ◽  
Qiuwen Zhang

As a novel swarm intelligence algorithm, artificial bee colony (ABC) algorithm inspired by individual division of labor and information exchange during the process of honey collection has advantage of simple structure, less control parameters, and excellent performance characteristics and can be applied to neural network, parameter optimization, and so on. In order to further improve the exploration ability of ABC, an artificial bee colony algorithm with random location updating (RABC) is proposed in this paper, and the modified search equation takes a random location in swarm as a search center, which can expand the search range of new solution. In addition, the chaos is used to initialize the swarm population, and diversity of initial population is improved. Then, the tournament selection strategy is adopted to maintain the population diversity in the evolutionary process. Through the simulation experiment on a suite of unconstrained benchmark functions, the results show that the proposed algorithm not only has stronger exploration ability but also has better effect on convergence speed and optimization precision, and it can keep good robustness and validity with the increase of dimension.


2013 ◽  
Vol 284-287 ◽  
pp. 3168-3172
Author(s):  
Ren Bin Xiao ◽  
Ying Cong Wang

It is the research hotspot for evolutionary algorithms to solve the contradiction between exploration and exploitation. Cellular artificial bee colony (CABC) algorithm is proposed by combining cellular automata with artificial bee colony algorithm from the perspective of the neighborhood in this paper. Each bee in the population structure defined in CABC has a fixed position and can only interact with bees in its neighborhood. The overlap between neighborhoods of different bees may make a bee an employed bee in one neighborhood and an onlooker bee in another neighborhood and vice versa, which increases the diversity of the population. The neighborhood and evolutionary rule help to control the selection pressure effectively, and the improved search mechanism in artificial bee colony algorithm is proposed to enhance the local search ability. The experimental results tested on four benchmark functions show that CABC can further balance the relationship between exploration and exploitation when compared with three ABC-based algorithms.


2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Li Ding ◽  
Hongtao Wu ◽  
Yu Yao

The purpose of this paper is devoted to developing a chaotic artificial bee colony algorithm (CABC) for the system identification of a small-scale unmanned helicopter state-space model in hover condition. In order to avoid the premature of traditional artificial bee colony algorithm (ABC), which is stuck in local optimum and can not reach the global optimum, a novel chaotic operator with the characteristics of ergodicity and irregularity was introduced to enhance its performance. With input-output data collected from actual flight experiments, the identification results showed the superiority of CABC over the ABC and the genetic algorithm (GA). Simulations are presented to demonstrate the effectiveness of our proposed algorithm and the accuracy of the identified helicopter model.


2019 ◽  
Vol 9 (22) ◽  
pp. 4824 ◽  
Author(s):  
Liangliang Yang ◽  
Bojun Sun ◽  
Xiaogang Sun

Based on the finite difference method and the artificial bee colony algorithm, the thermal conductivity in the two-dimensional unsteady-state heat transfer system is deduced. An improved artificial bee colony algorithm (IABCA), that artificial bee colony algorithm (ABCA) coupled with calculated deviation feedback, is proposed to overcome the shortcomings of insufficient local exploitation capacity and slow convergence rate in the late stage of the artificial bee colony algorithm (ABCA). For the forward problems, the finite difference method (FDM) is used to calculate the required temperature value of a discrete point; for the inverse problems, the IABCA is applied to minimize the objective function. In the inversion problem, the effects of colony size, number of measuring points, and the existence of measurement errors on the results are studied, and the inversion convergence rate of IABCA and ABCA is compared. The results demonstrate that the methods adopted in this paper had good effectiveness and accuracy even if colony sizes differ and measurement errors exist; and that IABCA has a more efficient convergence rate than ABCA.


Author(s):  
Waleed Alomoush ◽  
Ayat Alrosan ◽  
Ammar Almomani ◽  
Khalid Alissa ◽  
Osama A. Khashan ◽  
...  

Fuzzy c-means algorithm (FCM) is among the most commonly used in the medical image segmentation process. Nevertheless, the traditional FCM clustering approach has been several weaknesses such as noise sensitivity and stuck in local optimum, due to FCM hasn’t able to consider the information of contextual. To solve FCM problems, this paper presented spatial information of fuzzy clustering-based mean best artificial bee colony algorithm, which is called SFCM-MeanABC. This proposed approach is used contextual information in the spatial fuzzy clustering algorithm to reduce sensitivity to noise and its used MeanABC capability of balancing between exploration and exploitation that is explore the positive and negative directions in search space to find the best solutions, which leads to avoiding stuck in a local optimum. The experiments are carried out on two kinds of brain images the Phantom MRI brain image with a different level of noise and simulated image. The performance of the SFCM-MeanABC approach shows promising results compared with SFCM-ABC and other stats of the arts.


2021 ◽  
pp. 473-485
Author(s):  
Tao Zeng ◽  
Tingyu Ye ◽  
Luqi Zhang ◽  
Minyang Xu ◽  
Hui Wang ◽  
...  

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Fang Ye ◽  
Fei Che ◽  
Lipeng Gao

For the future information confrontation, a single jamming mode is not effective due to the complex electromagnetic environment. Selecting the appropriate jamming decision to coordinately allocate the jamming resources is the development direction of the electronic countermeasures. Most of the existing studies about jamming decision only pay attention to the jamming benefits, while ignoring the jamming cost. In addition, the conventional artificial bee colony algorithm takes too many iterations, and the improved ant colony (IAC) algorithm is easy to fall into the local optimal solution. Against the issue, this paper introduces the concept of jamming cost in the cognitive collaborative jamming decision model and refines it as a multiobjective one. Furthermore, this paper proposes a tabu search-artificial bee colony (TSABC) algorithm to cognitive cooperative-jamming decision. It introduces the tabu list into the artificial bee colony (ABC) algorithm and stores the solution that has not been updated after a certain number of searches into the tabu list to avoid meeting them when generating a new solution, so that this algorithm reduces the unnecessary iterative process, and it is not easy to fall into a local optimum. Simulation results show that the search ability and probability of finding the optimal solution of the new algorithm are better than the other two. It has better robustness, which is better in the “one-to-many” jamming mode.


2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
Lei Chen ◽  
Liyi Zhang ◽  
Yanju Guo ◽  
Yong Huang ◽  
Jingyi Liang

The computation amount in blind source separation based on bioinspired intelligence optimization is high. In order to solve this problem, we propose an effective blind source separation algorithm based on the artificial bee colony algorithm. In the proposed algorithm, the covariance ratio of the signals is utilized as the objective function and the artificial bee colony algorithm is used to solve it. The source signal component which is separated out, is then wiped off from mixtures using the deflation method. All the source signals can be recovered successfully by repeating the separation process. Simulation experiments demonstrate that significant improvement of the computation amount and the quality of signal separation is achieved by the proposed algorithm when compared to previous algorithms.


2016 ◽  
Vol 25 (04) ◽  
pp. 1650020 ◽  
Author(s):  
Lian Lian ◽  
Fu Zaifeng ◽  
Yang Guangfei ◽  
Huang Yi

Artificial bee colony (ABC) algorithm invented by Karaboga has been proved to be an efficient technique compared with other biological-inspired algorithms for solving numerical optimization problems. Unfortunately, convergence speed of ABC is slow when working with certain optimization problems and some complex multimodal problems. Aiming at the shortcomings, a hybrid artificial bee colony algorithm is proposed in this paper. In the hybrid ABC, an improved search operator learned from Differential Evolution (DE) is applied to enhance search process, and a not-so-good solutions selection strategy inspired by free search algorithm (FS) is introduced to avoid local optimum. Especially, a reverse selection strategy is also employed to do improvement in onlooker bee phase. In addition, chaotic systems based on the tent map are executed in population initialization and scout bee's phase. The proposed algorithm is conducted on a set of 40 optimization test functions with different mathematical characteristics. The numerical results of the data analysis, statistical analysis, robustness analysis and the comparisons with other state-of-the-art-algorithms demonstrate that the proposed hybrid ABC algorithm provides excellent convergence and global search ability.


Sign in / Sign up

Export Citation Format

Share Document