Search published articles


Showing 3 results for Goodarzi

P. Torkzadeh, Y. Goodarzi , E. Salajegheh,
Volume 3, Issue 3 (9-2013)
Abstract

In this study, an approach for damage detection of large-scale structures is developed by employing kinetic and modal strain energies and also Heuristic Particle Swarm Optimization (HPSO) algorithm. Kinetic strain energy is employed to determine the location of structural damages. After determining the suspected damage locations, the severity of damages is obtained based on variations of modal strain energy between the analytical models and the responses measured in damaged models using time history dynamic analysis data. In this paper, damages are modeled as a reduction of elasticity modulus of structural elements. The detection of structural damages is formulated as an unconstrained optimization problem that is solved by HPSO algorithm. To evaluate the performance of the proposed method, the results are compared with those provided in previous studies. To demonstrate the ability of this method for detection of multiple structural damages, different types of damage scenarios are considered. The results show that the proposed method can detect the exact locations and the severity of damages with a high accuracy in large-scale structures.
S. Talatahari, V. Goodarzimehr, S. Shojaee,
Volume 11, Issue 2 (5-2021)
Abstract

In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap in a local optimum. To fix this problem Harmony search (HS) algorithm, which has a high exploration and high exploitation, is applied as a complement to the SOS algorithm. The weight of the structures' elements is the objective function which minimized under displacement and stress constraints using finite element analysis. To prove the high capabilities of the new algorithm several spatial and planar benchmark truss structures, designed and optimized and the results have been compared with those of other researchers. The results show that the new algorithm has performed better in both exploitation and exploration than other meta-heuristic and mathematics methods.
V. Goodarzimehr, F. Salajegheh,
Volume 14, Issue 1 (1-2024)
Abstract

The analysis and design of high-rise structures is one of the challenges faced by researchers and engineers due to their nonlinear behavior and large displacements. The moment frame system is one of the resistant lateral load-bearing systems that are used to solve this problem and control the displacements in these structures. However, this type of structural system increases the construction costs of the project. Therefore, it is necessary to develop a new method that can optimize the weight of these structures. In this work, the weight of these significant structures is optimized by using one of the latest metaheuristic algorithms called special relativity search. The special relativity search algorithm is mainly developed for the optimization of continuous unconstrained problems. Therefore, a penalty function is used to prevent violence of the constraints of the problem, which are tension, displacement, and drift. Also, using an innovative technique to transform the discrete problem into a continuous one, the optimal design is carried out. To prove the applicability of the new method, three different problems are optimized, including an eight-story one-span, a fifteen-story three-span bending frame, and a twenty-four-story three-span moment frame. The weight of the structure is the objective function, which should be minimized to the lowest possible value without violating the constraints of the problem. The calculation of stress and displacements of the structure is done based on the regulations of AISC-LRFD requirements. To validate, the results of the proposed algorithm are compared with other advanced metaheuristic methods.
 

Page 1 from 1     

© 2024 CC BY-NC 4.0 | Iran University of Science & Technology

Designed & Developed by : Yektaweb