scholarly journals A Novel Artificial Bee Colony Algorithm for Structural Damage Detection

2020 ◽  
Vol 2020 ◽  
pp. 1-21 ◽  
Author(s):  
Yinghao Zhao ◽  
Quansheng Yan ◽  
Zheng Yang ◽  
Xiaolin Yu ◽  
Buyu Jia

A novel artificial bee colony (ABC) algorithm to detect structural damage via modal and frequency analyses is proposed (named as TCABC algorithm). Compared to the standard ABC algorithm, tabu search method and chaotic search method are adopted in the proposed algorithm to enhance the exploration and exploitation ability. The tabu search method uses a memory function to avoid the solution being trapped in a local minimum, which increases the exploitation ability. Chaotic search method generates more searching points for finding the global minimum, which increases the exploration ability. Additionally, the first roulette wheel selection is replaced by the tournament selection to enhance the global searching ability of the TCABC algorithm. Several explicit test functions and an implicit damage detection function are employed to check the numerical results obtained from ABC and TCABC algorithms. Afterward, the damage detection accuracy of the TCABC algorithm is verified under different circumstances, and several recommendations are given for using the TCABC algorithm to detect structural damages under actual conditions. Finally, an experimental study is applied to examine the performance of TCABC algorithm for damage detection. The results show the following: (1) compared to traditional ABC algorithm, TCABC algorithm performs better; (2) fewer groups lead to faster convergence as demonstrated by both algorithms used in the same damage situation; (3) TCABC algorithm can infer the locations and extents of the damage when the groupings are inaccurate; (4) the accuracy of the field test data profoundly affects the precision of the damage detection results. In other words, stronger noises result in worse identification results; (5) whether or not the noises exist, the more data are measured, the more accurate the results can be achieved; (6) the TCABC algorithm can efficiently detect structural damage in the experimental study.

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.


Sign in / Sign up

Export Citation Format

Share Document