International Journal of Optimization in Civil Engineering
عنوان نشریه
Iran University of Science & Technology
Engineering & Technology
http://ijoce.iust.ac.ir
18
agent2
2228-7558
doi
en
jalali
1400
5
1
gregorian
2021
8
1
11
3
online
1
fulltext
fa
COST OPTIMIZATION OF STEEL-CONCRETE COMPOSITE I-GIRDER BRIDGES WITH SKEW ANGLE AND LONGITUDINAL SLOPE, USING THE SM TOOLBOX AND THE PARALLEL PATTERN SEARCH ALGORITHM
In this research, the optimization problem of the steel-concrete composite I-girder bridges is investigated. The optimization process is performed using the <a name="_Hlk27003341">pattern search algorithm</a>, and a parallel processing-based approach is introduced to improve the performance of this algorithm. In addition, using the open application programming interface (OAPI), the SM toolbox is developed. In this toolbox, the OAPI commands are implemented as MATLAB functions. The design variables represent the number and dimension of the longitudinal beam and the thickness of the concrete slab. The constraints of this problem are presented in three steps. The first step includes the constraints on the web-plate and flange-plate proportion limits and those on the operating conditions. The second step consists of considering strength constraints, while the concrete slab is not yet hardened. In the third step, strength and deflection constraints are considered when the concrete slab is <a name="_Hlk28432479">hardened</a>. The AASHTO LRFD code (2007) for steel beam design and AASHTO LRFD (2014) for concrete slab design are used. The numerical examples of a sloping bridge with a skew angle are presented. Results show that active constraints are those on the operating conditions and component strength and that in terms of CPU time, a 19.6% improvement is achieved using parallel processing.
optimization, CSI OAPI, SM toolbox, steel-concrete composite I-girder bridges, parallel processing, pattern search algorithm.
357
382
http://ijoce.iust.ac.ir/browse.php?a_code=A-10-66-314&slc_lang=fa&sid=1
R.
Javanmardi
`180031947532846001770`

180031947532846001770
No
B.
Ahmadi-Nedushan
`180031947532846001771`

180031947532846001771
Yes