TY - JOUR
T1 - Proposing a novel oriented genetic algorithm for optimum seismic design of steel moment resisting frames
AU - Rastegaran, Mostafa
AU - Beheshti Aval, Seyed Bahram
AU - Noroozinejad Farsangi, Ehsan
AU - Faryabi, Ishagh
PY - 2022
Y1 - 2022
N2 - This paper proposes a new variant of the genetic algorithm (GA), called the oriented genetic algorithm (OGA), for optimum seismic design of steel special moment resisting frames. Since GA is mainly based on random operators, its computational burden is usually high. To overcome this issue, OGA takes advantage of the violation values of design constraints of the problem, such as elements’ demand-to-capacity ratios, strong column-weak beam requirements, and story drift ratios, to direct the search procedure. OGA is applied to a set of steel frames with different geometrical properties to demonstrate, and the results are compared to those of GA. The numerical results indicate that OGA significantly reduces the total number of function evaluations (NFE) required to obtain the optimum solutions. Also, the convergence history of OGA is compared with Particle Swarm Optimization and Ant Colony Optimization algorithms. It is shown that for a specified NFE limit, OGA gives better-optimized results.
AB - This paper proposes a new variant of the genetic algorithm (GA), called the oriented genetic algorithm (OGA), for optimum seismic design of steel special moment resisting frames. Since GA is mainly based on random operators, its computational burden is usually high. To overcome this issue, OGA takes advantage of the violation values of design constraints of the problem, such as elements’ demand-to-capacity ratios, strong column-weak beam requirements, and story drift ratios, to direct the search procedure. OGA is applied to a set of steel frames with different geometrical properties to demonstrate, and the results are compared to those of GA. The numerical results indicate that OGA significantly reduces the total number of function evaluations (NFE) required to obtain the optimum solutions. Also, the convergence history of OGA is compared with Particle Swarm Optimization and Ant Colony Optimization algorithms. It is shown that for a specified NFE limit, OGA gives better-optimized results.
UR - https://hdl.handle.net/1959.7/uws:72528
U2 - 10.1007/s13369-021-06338-4
DO - 10.1007/s13369-021-06338-4
M3 - Article
SN - 2191-4281
VL - 47
SP - 5003
EP - 5015
JO - Arabian Journal for Science and Engineering
JF - Arabian Journal for Science and Engineering
IS - 4
ER -