scholarly journals A Filtering Method for Grain Flow Signals Using EMD Thresholds Optimized by Artificial Bee Colony Algorithm

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 575 ◽  
Author(s):  
He Wang ◽  
Hua Song
Keyword(s):  
Artificial Bee Colony ◽  
Noise Signal ◽  
Threshold Function ◽  
Neighborhood Search ◽  
Intrinsic Mode Functions ◽  
Abc Algorithm ◽  
Filtering Method ◽  
Flow Signal ◽  
Bee Colony ◽  
Grain Flow

For the purpose of reducing noise from grain flow signal, this paper proposes a filtering method that is on the basis of empirical mode decomposition (EMD) and artificial bee colony (ABC) algorithm. At first, decomposing noise signal is performed adaptively into intrinsic mode functions (IMFs). Then, ABC algorithm is utilized to determine a proper threshold shrinking IMF coefficients instead of traditional threshold function. Furthermore, a neighborhood search strategy is introduced into ABC algorithm to balance its exploration and exploitation ability. Simulation experiments are conducted on four benchmark signals, and a comparative study for the proposed method and state-of-the-art methods are carried out. The compared results demonstrate that signal to noise ratio (SNR) and root mean square error (RMSE) are obtained by the proposed method. The conduction of which is finished on actual grain flow signal that is with noise for the demonstration of the effect in actual practice.

A quasi-affine transformation artificial bee colony algorithm for global optimization

2021 ◽  
pp. 1-18
Author(s):  
Baohua Zhao ◽  
Tien-Wen Sung ◽  
Xin Zhang
Keyword(s):  
Affine Transformation ◽  
Artificial Bee Colony ◽  
Triangular Matrix ◽  
Convergence Speed ◽  
Test Set ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Search Mechanism ◽  
Multiple Dimensions ◽  
Collaborative Search

The artificial bee colony (ABC) algorithm is one of the classical bioinspired swarm-based intelligence algorithms that has strong search ability, because of its special search mechanism, but its development ability is slightly insufficient and its convergence speed is slow. In view of its weak development ability and slow convergence speed, this paper proposes the QABC algorithm in which a new search equation is based on the idea of quasi-affine transformation, which greatly improves the cooperative ability between particles and enhances its exploitability. During the process of location updating, the convergence speed is accelerated by updating multiple dimensions instead of one dimension. Finally, in the overall search framework, a collaborative search matrix is introduced to update the position of particles. The collaborative search matrix is transformed from the lower triangular matrix, which not only ensures the randomness of the search, but also ensures its balance and integrity. To evaluate the performance of the QABC algorithm, CEC2013 test set and CEC2014 test set are used in the experiment. After comparing with the conventional ABC algorithm and some famous ABC variants, QABC algorithm is proved to be superior in efficiency, development ability, and robustness.

scholarly journals A Shuffle-Based Artificial Bee Colony Algorithm for Solving Integer Programming and Minimax Problems

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1211
Author(s):  
Ivona Brajević
Keyword(s):  
Integer Programming ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Minimax Problems ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Effective Performance ◽  
Complex Optimization ◽  
Overall Performance ◽  
Integer Programming Problems

The artificial bee colony (ABC) algorithm is a prominent swarm intelligence technique due to its simple structure and effective performance. However, the ABC algorithm has a slow convergence rate when it is used to solve complex optimization problems since its solution search equation is more of an exploration than exploitation operator. This paper presents an improved ABC algorithm for solving integer programming and minimax problems. The proposed approach employs a modified ABC search operator, which exploits the useful information of the current best solution in the onlooker phase with the intention of improving its exploitation tendency. Furthermore, the shuffle mutation operator is applied to the created solutions in both bee phases to help the search achieve a better balance between the global exploration and local exploitation abilities and to provide a valuable convergence speed. The experimental results, obtained by testing on seven integer programming problems and ten minimax problems, show that the overall performance of the proposed approach is superior to the ABC. Additionally, it obtains competitive results compared with other state-of-the-art algorithms.

scholarly journals MODIFIKASI BARU ALGORITMA KOLONI LEBAH BUATAN UNTUK MASALAH OPTIMASI GLOBAL

2018 ◽  
Vol 10 (1) ◽  
pp. 17
Author(s):  
Nursyiva Irsalinda ◽  
Sugiyarto Surono
Keyword(s):  
Food Source ◽  
Artificial Bee Colony ◽  
Selection Process ◽  
Optimization Technique ◽  
Food Sources ◽  
Abc Algorithm ◽  
Average Value ◽  
Bee Colony ◽  
Objective Function Values ◽  
Better Than

Artificial Bee Colony (ABC) algorithm is one of metaheuristic optimization technique based on population. This algorithm mimicking honey bee swarm to find the best food source. ABC algorithm consist of four phases: initialization phase, employed bee phase, onlooker bee phase and scout bee phase. This study modify the onlooker bee phase in selection process to find the neighborhood food source. Not all food sources obtained are randomly sought the neighborhood as in ABC algorithm. Food sources are selected by comparing their objective function values. The food sources that have value lower than average value in that iteration will be chosen by onlooker bee to get the better food source. In this study the modification of this algorithm is called New Modification of Artificial Bee Colony Algorithm (MB-ABC). MB-ABC was applied to 4 Benchmark functions. The results show that MB-ABC algorithm better than ABC algorithm

scholarly journals Skin Lesion Segmentation Method for Dermoscopy Images Using Artificial Bee Colony Algorithm

Symmetry ◽  
2018 ◽  
Vol 10 (8) ◽  
pp. 347 ◽  
Author(s):  
Mohanad Aljanabi ◽  
Yasa Özok ◽  
Javad Rahebi ◽  
Ahmad Abdullah
Keyword(s):  
Artificial Bee Colony ◽  
Survival Rates ◽  
High Specificity ◽  
Ground Truth ◽  
Threshold Value ◽  
Abc Algorithm ◽  
Melanoma Detection ◽  
Bee Colony ◽  
Average Accuracy ◽  
Different Sources

The occurrence rates of melanoma are rising rapidly, which are resulting in higher death rates. However, if the melanoma is diagnosed in Phase I, the survival rates increase. The segmentation of the melanoma is one of the largest tasks to undertake and achieve when considering both beneath and over the segmentation. In this work, a new approach based on the artificial bee colony (ABC) algorithm is proposed for the detection of melanoma from digital images. This method is simple, fast, flexible, and requires fewer parameters compared with other algorithms. The proposed approach is applied on the PH2, ISBI 2016 challenge, the ISBI 2017 challenge, and Dermis datasets. These bases contained images are affected by different abnormalities. The formation of the databases consists of images collected from different sources; they are bases with different types of resolution, lighting, etc., so in the first step, the noise was removed from the images by using morphological filtering. In the next step, the ABC algorithm is used to find the optimum threshold value for the melanoma detection. The proposed approach achieved good results in the conditions of high specificity. The experimental results suggest that the proposed method accomplished higher performance compared to the ground truth images supported by a Dermatologist. For the melanoma detection, the method achieved an average accuracy and Jaccard’s coefficient in the range of 95.24–97.61%, and 83.56–85.25% in these four databases. To show the robustness of this work, the results were compared to existing methods in the literature for melanoma detection. High values for estimation performance confirmed that the proposed melanoma detection is better than other algorithms, which demonstrates the highly differential power of the newly introduced features.

Ship Hull Form Optimization Using Artificial Bee Colony Algorithm

2014 ◽  
Author(s):  
Fuxin Huang ◽  
Lijue Wang ◽  
Chi Yang
Keyword(s):  
Drag Reduction ◽  
Artificial Bee Colony ◽  
Interpolation Method ◽  
Ship Hull ◽  
Mathematical Functions ◽  
Hull Form ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Hull Forms ◽  
Fast Flow

In this paper, artificial bee colony (ABC) algorithms are introduced to optimize ship hull forms for reduced drag. Two versions of ABC algorithm are used: one is the basic ABC algorithm, and the other is an improved artificial bee colony (IABC) algorithm. A recently developed fast flow solver based on the Neumann-Michell theory is used to evaluate the drag of the ship in the optimization process. The ship hull surface is represented by discrete triangular panels and modified using radial basis function interpolation method. The developed optimization algorithms are first validated by benchmark mathematical functions with different dimensions. They are then applied to the optimization of DTMB Model 5415 for reduced drag. Two optimal hull forms are obtained by the ABC and the IABC algorithms. A large drag reduction is obtained by both of the algorithms. The optimal hull form obtained by the IABC algorithm has larger drag reduction than that of the hull form from the ABC algorithm. The results show that two ABC algorithms can be used for optimizing ship hull forms and the IABC algorithm has better performance than the ABC algorithm for the tested case in ship hull form optimization.

Sign in / Sign up

Export Citation Format

Share Document