AU - Kazemzadeh Azad, S.
AU - Hasançebi, O.
TI - IMPROVING COMPUTATIONAL EFFICIENCY OF PARTICLE SWARM OPTIMIZATION FOR OPTIMAL STRUCTURAL DESIGN
PT - JOURNAL ARTICLE
TA - IUST
JN - IUST
VO - 3
VI - 4
IP - 4
4099 - http://ijoce.iust.ac.ir/article-1-148-en.html
4100 - http://ijoce.iust.ac.ir/article-1-148-en.pdf
SO - IUST 4
AB - This paper attempts to improve the computational efficiency of the well known particle swarm optimization (PSO) algorithm for tackling discrete sizing optimization problems of steel frame structures. It is generally known that, in structural design optimization applications, PSO entails enormously time-consuming structural analyses to locate an optimum solution. Hence, in the present study it is attempted to lessen the computational effort of the algorithm, using the so called upper bound strategy (UBS), which is a recently proposed strategy for reducing the total number of structural analyses involved in the course of design optimization. In the UBS, the key issue is to identify those candidate solutions which have no chance to improve the search during the optimum design process. After identifying those non-improving solutions, they are directly excluded from the structural analysis stage, diminishing the total computational cost. The performance of the UBS integrated PSO algorithm (UPSO) is evaluated in discrete sizing optimization of a real scale steel frame to AISC-LRFD specifications. The numerical results demonstrate that the UPSO outperforms the original PSO algorithm in terms of the computational efficiency.
CP - IRAN
IN -
LG - eng
PB - IUST
PG - 563
PT - Research
YR - 2013