Details

Autor(en) / Beteiligte

• Joshi, Milan
• Kalita, Kanak
• Jangir, Pradeep
• Ahmadianfar, Iman
• Chakraborty, Shankar

Titel

A Conceptual Comparison of Dragonfly Algorithm Variants for CEC-2021 Global Optimization Problems

Ist Teil von

• Arabian journal for science and engineering (2011), 2023-02, Vol.48 (2), p.1563-1593

Ort / Verlag

Berlin/Heidelberg: Springer Berlin Heidelberg

Erscheinungsjahr

2023

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• Since the past few years, several metaheuristic algorithms, inspired by the natural processes, have been introduced to solve different complex optimization problems. Studying and comparing the convergence, computational burden and statistical significance of those metaheuristics are helpful for future algorithmic development and their applications. This paper focuses on comparing the optimization performance of classical dragonfly algorithm (DA) and its seven different variants, i.e., hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder–Mead algorithm and dragonfly algorithm (INMDA) and hybridization of dragonfly algorithm and artificial bee colony (HDA) while solving 80 CEC-2021 benchmark problems. It is observed that the convergence rates of different variants of DA algorithm vary, and the corresponding computational times for such variations are also evaluated. This paper finally ranks DA and its variants according to their convergence efficiency and Friedman test. The DADE, QGDA, BMDA and DA evolve out as the most efficient algorithms for solving the considered CEC-2021 benchmark problems.