Investigation of Required Numbers of Runs for Verification of Jaya Algorithm for a Structural Engineering Problem

Cosut M., Bekdas G., Nigdeli S. M.

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

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 140
  • Doi Numarası: 10.1007/978-981-19-2948-9_39
  • Basıldığı Ülke: ELECTR NETWORK
  • Sayfa Sayıları: ss.407-412
  • Anahtar Kelimeler: T-beam, CFRP, Optimization, Minimum area design, Jaya algorithm
  • İstanbul Üniversitesi-Cerrahpaşa Adresli: Evet

Özet

In this study, a construction element using carbon fiber reinforced polymer (CFRP) material was optimized to increase the shear capacity of T-section reinforced concrete beams using the Jaya algorithm. For the objective function, it is aimed that the values of the spacing of the most suitable material strips, the width of the strips, and the angle of the strips are optimized to create a minimum area increasing the shear capacity with the desired amount. The algorithm has different values for 100 iterations and 1000 iterations when several runs (5, 10, 15, 20, 25, 30, 40, 50) of running the program are evaluated. In low iterations, it is observed that the standard deviations as a result of different runs are very big values, but it approaches the minimum area as the number of runs is increased. It has been observed that when the number of iterations is big, as the number of runs increases, it approaches the minimum area very close and the standard deviation takes very small values.