A modified dragonfly optimization algorithm for single- and multiobjective problems using brownian motion

Abstract

The dragonfly algorithm (DA) is one of the optimization techniques developed in recent years. The random flying behavior of dragonflies in nature is modeled in the DA using the Levy flight mechanism (LFM). However, LFM has disadvantages such as the overflowing of the search area and interruption of random flights due to its big searching steps. In this study, an algorithm, known as the Brownian motion, is used to improve the randomization stage of the DA. The modified DA was applied to 15 single-objective and 6 multiobjective problems and then compared with the original algorithm. The modified DA provided up to 90% improvement compared to the original algorithm's minimum point access. The modified algorithm was also applied to welded beam design, a well-known benchmark problem, and thus was able to calculate the optimum cost 20% lower.