Large-Scale Truss-Sizing Optimization with Enhanced Hybrid HS Algorithm

OpenAlex İngilizce

Metaheuristic algorithms currently represent the standard approach to engineering optimization. A very challenging field is large-scale structural optimization, entailing hundreds of design variables and thousands of nonlinear constraints on element stresses and nodal displacements. However, very few studies documented the use of metaheuristic algorithms in large-scale structural optimization. In order to fill this gap, an enhanced hybrid harmony search (HS) algorithm for weight minimization of large-scale truss structures is presented in this study. The new algorithm, Large-Scale Structural Optimization–Hybrid Harmony Search JAYA (LSSO-HHSJA), developed here, combines a well-established method like HS with a very recent method like JAYA, which has the simplest and inherently most powerful search engine amongst metaheuristic optimizers. All stages of LSSO-HHSJA are aimed at reducing the number of structural analyses required in large-scale structural optimization. The basic idea is to move along descent directions to generate new trial designs, directly through the use of gradient information in the HS phase, indirectly by correcting trial designs with JA-based operators that push search towards the best design currently stored in the population or the best design included in a local neighborhood of the currently analyzed trial design. The proposed algorithm is tested in three large-scale weight minimization problems of truss structures. Optimization results obtained for the three benchmark examples, with up to 280 sizing variables and 37,374 nonlinear constraints, prove the efficiency of the proposed LSSO-HHSJA algorithm, which is very competitive with other HS and JAYA variants as well as with commercial gradient-based optimizers.