A novel artificial bee colony algorithm with depth-first search framework and elite-guided search equation

2016 ◽  
Vol 367-368 ◽  
pp. 1012-1044 ◽  
Author(s):  
Laizhong Cui ◽  
Genghui Li ◽  
Qiuzhen Lin ◽  
Zhihua Du ◽  
Weifeng Gao ◽  
...  
2017 ◽  
Vol 14 (3) ◽  
pp. 751-767 ◽  
Author(s):  
Zhenxin Du ◽  
Dezhi Han ◽  
Guangzhong Liu ◽  
Jianxin Jia

ABC_elite, a novel artificial bee colony algorithm with elite-guided search equations, has been put forward recently, with relatively good performance compared with other variants of artificial bee colony (ABC) and some non-ABC methods. However, there still exist some drawbacks in ABC_elite. Firstly, the elite solutions employ the same equation as ordinary solutions in the employed bee phase, which may easily result in low success rates for the elite solutions because of relatively large disturbance amplitudes. Secondly, the exploitation ability of ABC_elite is still insufficient, especially in the latter half of the search process. To further improve the performance of ABC_elite, two novel search equations have been proposed in this paper, the first of which is used in the employed bee phase for elite solutions to exploit valuable information of the current best solution, while the second is used in the onlooker bee phase to enhance the exploitation ability of ABC_elite. In addition, in order to better balance exploitation and exploration, a parameter Po is introduced into the onlooker bee phase to decide which search equation is to be used, the existing search equation of ABC_elite or a new search equation proposed in this paper. By combining the two novel search equations together with the new parameter Po, an improved ABC_elite (IABC_elite) algorithm is proposed. Based on experiments concerning 22 benchmark functions, IABC elite has been compared with some other state-of-the-art ABC variants, showing that IABC_elite performs significantly better than ABC_elite on solution quality, robustness, and convergence speed.


2019 ◽  
Vol 16 (3) ◽  
pp. 773-795
Author(s):  
Letian Duan ◽  
Dezhi Han ◽  
Qiuting Tian

Intrusion detection is a hot topic in network security. This paper proposes an intrusion detection method based on improved artificial bee colony algorithm with elite-guided search equations (IABC elite) and Backprogation (BP) neural net works. The IABC elite algorithm is based on the depth first search framework and the elite-guided search equations, which enhance the exploitation ability of artificial bee colony algorithm and accelerate the convergence. The IABC elite algorithm is used to optimize the initial weight and threshold value of the BP neural networks, avoiding the BP neural networks falling into a local optimum during the training process and improving the training speed. In this paper, the BP neural networks optimized by IABC elite algorithm is applied to intrusion detection. The simulation on the NSL-KDD dataset shows that the intrusion detection system based on the IABC elite algorithm and the BP neural networks has good classification and high intrusion detection ability.


2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi

A modified version of the artificial Bee Colony Algorithm (ABC) was suggested namely Adaptive Dimension Limit- Artificial Bee Colony Algorithm (ADL-ABC). To determine the optimum global path for mobile robot that satisfies the chosen criteria for shortest distance and collision–free with circular shaped static obstacles on robot environment. The cubic polynomial connects the start point to the end point through three via points used, so the generated paths are smooth and achievable by the robot. Two case studies (or scenarios) are presented in this task and comparative research (or study) is adopted between two algorithm’s results in order to evaluate the performance of the suggested algorithm. The results of the simulation showed that modified parameter (dynamic control limit) is avoiding static number of limit which excludes unnecessary Iteration, so it can find solution with minimum number of iterations and less computational time. From tables of result if there is an equal distance along the path such as in case A (14.490, 14.459) unit, there will be a reduction in time approximately to halve at percentage 5%.


2013 ◽  
Vol 32 (12) ◽  
pp. 3326-3330
Author(s):  
Yin-xue ZHANG ◽  
Xue-min TIAN ◽  
Yu-ping CAO

Sign in / Sign up

Export Citation Format

Share Document