The Gaussian Mutational Barebone Dragonfly Algorithm: From Design to Analysis

• Published in: Symmetry (Basel) Vol. 14; no. 2; p. 331
• Main Authors: Yuan, Li, Kuang, Fangjun, Zhang, Siyang, Chen, Huiling
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.02.2022
• Subjects: Accuracy; Algorithms; Convergence; Design engineering; Exploitation; Fault diagnosis; Global optimization; Mutation; Neural networks; Optimization algorithms; Performance enhancement; Support vector machines; Swarm intelligence; Swarming; Symmetry; Traveling salesman problem; Velocity
• ISSN: 2073-8994; 2073-8994
• DOI: 10.3390/sym14020331

The dragonfly algorithm is a swarm intelligence optimization algorithm based on simulating the swarming behavior of dragonfly individuals. An efficient algorithm must have a symmetry of information between the participating entities. An improved dragonfly algorithm is proposed in this paper to further improve the global searching ability and the convergence speed of DA. The improved DA is named GGBDA, which adds Gaussian mutation and Gaussian barebone on the basis of DA. Gaussian mutation can randomly update the individual positions to avoid the algorithm falling into a local optimal solution. Gaussian barebone can quicken the convergent speed and strengthen local exploitation capacities. Enhancing algorithm efficiency relative to the symmetric concept is a critical challenge in the field of engineering design. To verify the superiorities of GGBDA, this paper sets 30 benchmark functions, which are taken from CEC2014 and 4 engineering design problems to compare GGBDA with other algorithms. The experimental result show that the Gaussian mutation and Gaussian barebone can effectively improve the performance of DA. The proposed GGBDA, similar to the DA, presents improvements in global optimization competence, search accuracy, and convergence performance.