Please use this identifier to cite or link to this item:
|Title||Design Optimization of Semi Rigid Steel Framed Structures to AISC- LRFD Using Harmony Search Algorithm|
The aim of this research is to develop a computer design model which obtains the optimum design of multistorey steel frames by selecting from a standard set of steel sections. Strength constraints of American Institute Steel Construction (AISC)-Load and Resistance Factor Design (LRFD) specification, displacement constraints and size constraint for beam-columns were imposed on frames. Harmony search (HS) is a recently developed metaheuristic search algorithm that was conceptualized using the musical process of searching for a perfect state of harmony. The harmony in music is analogous to the optimization solution vector, and the musician’s improvisations are analogous to local and global search schemes in optimization techniques. The HS algorithm does not require initial values for the decision variables. Furthermore, instead of a gradient search, the HS algorithm uses a stochastic random search that is based on the harmony memory considering rate and the pitch adjusting rate so that derivative information is unnecessary. The HS algorithm accounts for the effect of the flexibility of the connections and the geometric non-linearity of the members. The semi-rigid connections are modelled with the Frye–Morris polynomial model. Moreover, two steel frames with extended end plate without column stiffeners are designed using HS algorithm. Full Catalog Section (FCS) and Selected Catalog Section (SCS) are used to compare the obtained results. The results prove that harmony search algorithm is a powerful and effective tools, in comparison with genetic algorithm. Also the comparisons showed that the harmony search algorithm yielded lighter frame in case of rigid and semi-rigid connections for the presented models. In addition, using the Selected Catalog Sections the optimum frames are lighter than that of the Full Catalog Sections. Moreover, HS converges to optimum designs before the maximum numbers of iterations executed in almost designs.
|Publisher||the islamic university|
|Files in this item|