Premium
Advanced energy‐based analyses of trusses employing hybrid metaheuristics
Author(s) -
Bekdaş Gebrail,
Kayabekir Aylin Ece,
Nigdeli Sinan Melih,
Toklu Yusuf Cengiz
Publication year - 2019
Publication title -
the structural design of tall and special buildings
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.895
H-Index - 43
eISSN - 1541-7808
pISSN - 1541-7794
DOI - 10.1002/tal.1609
Subject(s) - harmony search , metaheuristic , differential evolution , particle swarm optimization , mathematical optimization , computer science , algorithm , parallel metaheuristic , truss , hybrid algorithm (constraint satisfaction) , nonlinear system , probabilistic logic , mathematics , meta optimization , engineering , artificial intelligence , local consistency , physics , structural engineering , quantum mechanics , constraint satisfaction
Summary Total potential optimization using metaheuristic algorithm (TPO/MA) is an alternative method in structural analyses, and it is a black‐box application for nonlinear analyses. In the study, an advanced TPO/MA using hybridization of several metaheuristic algorithms is investigated to solve large‐scale structural analyses problems. The new generation algorithms considered in the study are flower pollination algorithm (FPA), teaching learning‐based optimization, and Jaya algorithm (JA). Also, the proposed methods are compared with methodologies using classic and previously used algorithms such as differential evaluation, particle swarm optimization, and harmony search. Numerical investigations were carried out for structures with four to 150 degrees of freedoms (design variables). It has been seen that in several runs, JA gets trapped into local solutions. For that reason, four different hybrid algorithms using fundamentals of JA and phases of other algorithms, namely, JA using Lévy flights, JA using Lévy flights and linear distribution, JA with consequent student phase, and JA with probabilistic student phase (JA1SP), are developed. It is observed that among the variants tried, JA1SP is seen to be more effective on approaching to the global optimum without getting trapped in a local solution.