COMPUTATIONALLY EFFICIENT OPTIMUM DESIGN OF LARGE SCALE STEEL FRAMES

Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC-LRFD specifications. To this end an upper bound strategy (UBS), which is a recently proposed strategy for reducing the total number of structural analyses in metaheuristic optimization algorithms, is used in conjunction with an exponential variant of the well-known big bang-big crunch optimization algorithm. The performance of the UBS integrated algorithm is investigated in the optimum design of two large-scale steel frame structures with ۳۸۶۰ and ۱۱۵۴۰ structural members. The obtained numerical results clearly reveal the usefulness of the employed technique in practical optimum design of large-scale structural systems even using regular computers.

Keywords:

Structural optimization , metaheuristic search techniques , big bang-big crunch algorithm , upper bound strategy , large-scale steel frames , AISC-LRFD