Showing 4 results for Constrained Optimization
A. Kaveh , V.r. Mahdavi,
Volume 2, Issue 2 (6-2012)
Abstract
Endurance Time Acceleration Functions are specially predesigned intensifying excitation functions that their amplitude increases with time. On the other hand, wavelet transform is a mathematical tool that indicates time variations of frequency in a signal. In this paper, an approach is presented for generating endurance time acceleration functions (ETAFs) whose response spectrum is compatible with the European Code regulations (EC8) elastic spectrum. Method applied is a modification of data in time and frequency domain. For this purpose, wavelet transform has been used to decompose a series of random points to several levels such that each level covers a special range of frequency, then every level is divided into the numbers of equal time intervals and each interval of time is multiplied by a variable. Subsequently, the mathematical unconstrained optimization algorithm is used to calculate the variables and minimize error between response and target spectra. The prosed procedure is used in two methods. Then with two methods, two different acceleration functions are produced.
M. Shahrouzi,
Volume 10, Issue 3 (6-2020)
Abstract
Meta-heuristics have received increasing attention in recent years. The present article introduces a novel method in such a class that distinguishes a number of artificial search agents called players within two teams. At each iteration, the active player concerns some other players in both teams to construct its special movements and to get more score. At the end of some iterations (like quarters of a sports game) the teams switch their places for fair play. The algorithm is developed to solve a general purpose optimization problem; however, in this article its application is illustrated on structural sizing design. Switching Teams Algorithm is presented as a parameter-less population-based algorithm utilizing just two control parameters. The proposed method can recover diversity in a novel manner compared to other meta-heuristics in order to capture global optima.
S. Sarjamei, M. S. Massoudi, M. Esfandi Sarafraz,
Volume 11, Issue 2 (5-2021)
Abstract
L. Coelho, M. Shahrouzi, N. Khavaninzadeh,
Volume 14, Issue 4 (10-2024)
Abstract
Diagrids are of practical interest in high-rise buildings due to their architectural configuration and efficiency in withstanding lateral loads by exterior diagonal members. In the present work, diagrid models are screened based on a sizing optimization approach. Section index of each member group is treated as a discrete design variable in the optimization problem to be solved. The structural constraints are evaluated due to Load and Resistant Design Factor regulations under both gravitational and wind loadings. The research is threefold: first, falcon optimization algorithm is utilized as a meta-heuristic paradigm for such a large-scale and highly constrained discrete problem. Second, the effect of geometry variation in diagrids on minimal structural weight is studied for 18 diagrid models via three different heights (12, 20 and 30 stories) and three diagrid angles. Third, distinct cases of rigid and flexible bases are compared to study the effect of such boundary conditions on the results. The effect of soil flexibility beneath the foundation on the optimal design was found highly dependent on the diagrid geometry. The best weight and performance in most of the treated examples belong to the geometry that covers two stories by every grid line on the flexible-base.