Optimization of Truss Structures by Using a Hybrid Population-Based Metaheuristic Algorithm


Yücel M., NİGDELİ S. M., BEKDAŞ G.

Arabian Journal for Science and Engineering, cilt.49, sa.4, ss.5011-5026, 2024 (SCI-Expanded, Scopus) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 49 Sayı: 4
  • Basım Tarihi: 2024
  • Doi Numarası: 10.1007/s13369-023-08319-1
  • Dergi Adı: Arabian Journal for Science and Engineering
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, Communication Abstracts, Metadex, Pollution Abstracts, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.5011-5026
  • Anahtar Kelimeler: Flower pollination algorithm, Hybridization, Jaya algorithm, Metaheuristic algorithms, Optimization, Truss structures
  • İstanbul Üniversitesi-Cerrahpaşa Adresli: Evet

Özet

Structural engineering is a field with several optimization approaches. Concordantly, the goal in optimum design is the generation of the lightest, cheapest, or most sustainable engineering design for any type of structure or structural member. In this study, some optimization approaches were presented for structures including 25 and 72-bar space trusses. To find the smallest weights were ensured for both structures. Optimization approaches related to metaheuristics and modifications of them were developed by inspired by features of nature, abilities of lives and mechanisms of chemical/physical processes. The employed three techniques that are flower pollination algorithm, Jaya algorithm and the hybrid algorithm developed via them were compared to each other through some parameters by calculating different statistical expressions containing the best, average and standard deviation of the objective function. Also, the performance of whole metaheuristic versions is evaluated with some literature researches to find the most effective one to minimize the structural weights. These results have observed that the all versions of proposed metaheuristic algorithms are generally successful, and effective to minimize the objective function comparison to algorithms used in previous studies. Moreover, the best values of objective functions can be decreased at the 0.02–0.06 rates as minimum and maximum compared to the previous studies and algorithms, respectively.