WSAR with Levy Flight for Constrained Optimization

BAYKASOĞLU A., ŞENOL M. E.

7th International Conference on Harmony Search, Soft Computing and Applications (ICHSA), ELECTR NETWORK, 23 - 24 Şubat 2022, cilt.140, ss.217-225 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 140
  • Doi Numarası: 10.1007/978-981-19-2948-9_21
  • Basıldığı Ülke: ELECTR NETWORK
  • Sayfa Sayıları: ss.217-225
  • Anahtar Kelimeler: WSAR algorithm, Harmony search, Levy flight, Constrained design optimization problems, SUPERPOSITION ATTRACTION WSA, SWARM INTELLIGENCE ALGORITHM, DESIGN OPTIMIZATION, CHAOS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

The Levy distribution, which represents a form of random walk (Levy flight) consisting of a series of consecutive random steps, has recently been demonstrated to improve the performance of metaheuristic algorithms. Through consecutive random steps, Levy flight is particularly beneficial for undertaking massive "jump" operations that allow the search to escape from a local optimum and restart in a different region of the search space. We examine this concept in this work by applying Levy flight to weighted superposition attraction-repulsion algorithm (WSAR), a basic but effective swarm intelligence optimization method that was recently introduced in the literature. The experiments are performed on several constrained design optimization problems. The performance of the proposed Levy flight WSAR algorithm is compared with several metaheuristics including harmony search algorithm (HS) and plain WSAR. The computational results revealed that Levy flight WSAR (LF-WSAR) is able to outperform the other algorithms. HS and WSAR show competitive performance with each other. In addition, performance of the LF-WSAR is statistically compared with other algorithms through nonparametric statistical tests. According to the statistical results, the difference between LF-WSAR and other algorithm is statistically significant.