scholarly journals Multiple Crack Detection in Thick-walled Pipes Using Artificial Bee Colony Algorithm

Author(s):  
Amir Banimahd ◽  
Mohammad Amir Rahemi

An analytical method for diagnosis of cracks in thick-walled pipes with a circular hollow section is investigated in this study. In the proposed method, the defect is assumed to be a non-leaking crack, which is modeled by a massless linear spring with infinitesimal length at the crack location. In order to find the cracks in the pipe, the vibration-based method related to the modal properties of the pipe is utilized. In the modal analysis, the mass and stiffness matrices influence the dynamic properties of the pipe. It is assumed that the mass matrix remains unchanged after the crack initiation, while the corresponding stiffness matrix changes. The stiffness matrix of a cracked element can be formulated by the finite element method with two unknown parameters: location and depth of the crack. Using the eigensolution for an undamped dynamic system to formulate the objective function yields to a complicated optimization problem, which can be solved by an iterative numerical optimization method. Among the optimization approaches, the Artificial Bee Colony (ABC) algorithm is a simple and flexible technique for minimizing the objective function. In this paper, the analytical model is utilized to find the size and position of cracks in a pipe using the ABC algorithm and subsequently some numerical examples are examined in order to assess the accuracy of the method. The results show that the proposed method is able to acceptably estimate the location and depth of multiple cracks in the straight pipes as well as curved ones.

2020 ◽  
Vol 10 (1) ◽  
pp. 29-36
Author(s):  
Ririn Nirmalasari ◽  
◽  
Agus Suryanto ◽  
Syaiful Anam

The Artificial Bee Colony (ABC) is one of the stochastic algorithms that can be applied to solve many real-world optimization problems. In this paper, The ABC algorithm was used to estimate the parameter of the epidemic influenza model. This model consists of a differential system represented by variations of Susceptible (S), Exposed (E), Recovered (R), and Infected (I). The ABC processes explore the minimum value of the mean square error function in the current iteration to estimate the unknown parameters of the model. Estimating parameters were made using participation data containing influenza disease in Australia, 2017. The best parameter chosen from the ABC process matched the dynamical behavior of the influenza epidemic field data used. Graphical analysis was used to validate the model. The result shows that the ABC algorithm is efficient for estimating the parameter of the epidemic influenza model.


Sensors ◽  
2020 ◽  
Vol 20 (19) ◽  
pp. 5597
Author(s):  
Chien-Sheng Chen ◽  
Jen-Fa Huang ◽  
Nan-Chun Huang ◽  
Kai-Sheng Chen

With the mature technology of wireless communications, the function of estimating the mobile station (MS) position has become essential. Suppressing the bias resulting from non-line-of-sight (NLSO) scenarios is the main issue for a wireless location network. The artificial bee colony (ABC) algorithm, based on the depiction of bee swarm’s foraging characteristics, is widely applied to solve optimization problems in several fields. Based on three measurements of time-of-arrival (TOA), an objective function is used to quantify the additional NLOS error on the MS positioning scheme. The ABC algorithm is adopted to locate the most precise MS location by minimizing the objective function value. The performance of the proposed positioning methods is verified under various error distributions through computer simulations. Meanwhile, the localization accuracy achieved by other existing methods is also investigated. According to the simulation results, accurate estimation of the MS position is derived and therefore the efficiency of the localization process is increased.


2021 ◽  
pp. 1-18
Author(s):  
Baohua Zhao ◽  
Tien-Wen Sung ◽  
Xin Zhang

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.


Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1211
Author(s):  
Ivona Brajević

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.


2018 ◽  
Vol 10 (1) ◽  
pp. 17
Author(s):  
Nursyiva Irsalinda ◽  
Sugiyarto Surono

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


Symmetry ◽  
2018 ◽  
Vol 10 (8) ◽  
pp. 347 ◽  
Author(s):  
Mohanad Aljanabi ◽  
Yasa Özok ◽  
Javad Rahebi ◽  
Ahmad Abdullah

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.


Sign in / Sign up

Export Citation Format

Share Document