Optimum Design of Reinforced Concrete Folded Plate Structures to ACI 318-11 Using Soft Computing Algorithm
Genre
Journal articleDate
2022-05-12Department
Civil and Environmental EngineeringSubject
Folded plateSupporting members
Minimum cost design
Structural optimization
Metaheuristic algorithms
Beetle antennae search algorithm
Artificial bee colony algorithm
Differential evolution algorithm
Permanent link to this record
http://hdl.handle.net/20.500.12613/9663
Metadata
Show full item recordDOI
http://dx.doi.org/10.3390/math10101668Abstract
In this paper, an optimum design algorithm is presented for reinforced concrete folded plate structures. The design provisions are implemented by ACI 318-11 and ACI 318.2-14, which are quite complex to apply. The design variables are divided into three classes. The first class refers to the variables involving the plates, which are the number of supports, thicknesses of the plates, configurations of longitudinal and transverse reinforcement, span length of each plate, and angle of inclination of the inclined plates. The second class consists of the variables involving the auxiliary members’ (beams and diaphragms) depth and breadth and the configurations of longitudinal and shear reinforcement. The third class of variables can be the supporting columns, which involve the dimensions of the column along each axis and the configurations of longitudinal and shear reinforcement. The objective function is considered as the total cost of the folded plate structure, which consists of the cost of concrete, reinforcement, and formwork that is required to construct the building. With such formulation, the design problem becomes a discrete nonlinear programming problem. Its solution is obtained by using three different soft computing techniques, which are artificial bee colony, differential evolution, and enhanced beetle antennae search. The enhancement suggested makes use of the population of beetles instead of one, as is the case in the standard algorithm. With this novel improvement, the beetle antennae search algorithm became very efficient. Two folded plate structures are designed by the proposed optimum design algorithm. It is observed that the differential evolution algorithm performed better than the other two metaheuristics and achieved the cheapest solution.Citation
Yousif, S.; Saka, M.P.; Kim, S.; Geem, Z.W. Optimum Design of Reinforced Concrete Folded Plate Structures to ACI 318-11 Using Soft Computing Algorithm. Mathematics 2022, 10, 1668. https://doi.org/10.3390/math10101668Citation to related work
MDPIHas part
Mathematics, Vol. 10, Iss. 10ADA compliance
For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.eduCollections
Related items
Showing items related by title, author, creator and subject.
-
FFRU: A Time- and Space-Efficient Caching AlgorithmBeigel, Richard; Shi, Yuan; Wang, Pei, 1958-; Szyld, Daniel (Temple University. Libraries, 2021)Cache replacement policies have applications that are nearly ubiquitous in technology. Among these is an interesting subset which occurs when referentially transparent functions are memoized, eg. in compilers, in dynamic programming, and other software caches. In many applications the least recently used (LRU) approach likely preserves items most needed by memoized function calls. However, despite its popularity LRU is expensive to implement, which has caused a spate of research initiatives aimed at approximating its cache miss performance in exchange for faster and more memory efficient implementations. We present a novel caching algorithm, Far From Recently Used (FFRU), which offers a simple, but highly configurable mechanism for providing lower bounds on the usage recency of items evicted from the cache. This algorithm preserves the constant time amortized cost of insertions and updates and minimizes the memory overhead needed to administer the eviction guarantees. We study the cache miss performance of several memoized optimization problems which vary in the number of subproblems generated and the access patterns exhibited by their recursive calls. We study their cache miss performance using LRU cache replacement, then show the performance of FFRU in these same problem scenarios. We show that for equivalent minimum eviction age guarantees, FFRU incurs fewer cache misses than LRU, and does so using less memory. We also present some variations of the algorithms studied (Fibonacci, KMP, LCS, and Euclidean TSP) which exploit the characteristics of the cache replacement algorithms being employed, further resulting in improved cache miss performance. We present a novel implementation of a well known approximation algorithm for the Euclidean Traveling Salesman Problem due to Sanjeev Arora. Our implementation of this algorithm outperforms the currently known implementations of the same. It has long remained an open question whether or not algorithms relying on geometric divisions of space can be implemented into practical tools, and our powerful implementation of Arora's algorithm establishes a new benchmark in that arena.
-
Parameters Optimization of Taguchi Method Integrated Hybrid Harmony Search Algorithm for Engineering Design ProblemsUray, Esra; Carbas, Serdar; Geem, Zong Woo; Kim, Sanghun; Kim|0000-0002-1423-6116 (2022-01-21)Performance of convergence to the optimum value is not completely a known process due to characteristics of the considered design problem and floating values of optimization algorithm control parameters. However, increasing robustness and effectiveness of an optimization algorithm may be possible statistically by estimating proper algorithm parameters values. Not only the algorithm which utilizes these estimated-proper algorithm parameter values may enable to find the best fitness in a shorter time, but also it may supply the optimum searching process with a pragmatical manner. This study focuses on the statistical investigation of the optimum values for the control parameters of the harmony search algorithm and their effects on the best solution. For this purpose, the Taguchi method integrated hybrid harmony search algorithm has been presented as an alternative method for optimization analyses instead of sensitivity analyses which are generally used for the investigation of the proper algorithm parameters. The harmony memory size, the harmony memory considering rate, the pitch adjustment rate, the maximum iteration number, and the independent run number of entire iterations have been debated as the algorithm control parameters of the harmony search algorithm. To observe the effects of design problem characteristics on control parameters, the new hybrid method has been applied to different engineering optimization problems including several engineering-optimization examples and a real-size engineering optimization design. End of extensive optimization and statistical analyses to achieve optimum values of control parameters providing rapid convergence to optimum fitness value and handling constraints have been estimated with reasonable relative errors. Employing the Taguchi method integrated hybrid harmony search algorithm in parameter optimization has been demonstrated as it is a reliable and efficient manner to obtain the optimum results with fewer numbers of run and iteration.
-
On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equationsFrommer, Andreas; Szyld, Daniel B. (2022-11-16)We extend results known for the randomized Gauss-Seidel and the Gauss-Southwell methods for the case of a Hermitian and positive definite matrix to certain classes of non-Hermitian matrices. We obtain convergence results for a whole range of parameters describing the probabilities in the randomized method or the greedy choice strategy in the Gauss-Southwell-type methods. We identify those choices which make our convergence bounds best possible. Our main tool is to use weighted ℓ1-norms to measure the residuals. A major result is that the best convergence bounds that we obtain for the expected values in the randomized algorithm are as good as the best for the deterministic, but more costly algorithms of Gauss-Southwell type. Numerical experiments illustrate the convergence of the method and the bounds obtained. Comparisons with the randomized Kaczmarz method are also presented.