Volume 9, Issue 3 (September 2011)                   IJCE 2011, 9(3): 193-206 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Kaveh A, Sabzi O. A comparative study of two meta-heuristic algorithms for optimum design of reinforced concrete frames. IJCE 2011; 9 (3) :193-206
URL: http://ijce.iust.ac.ir/article-1-477-en.html
Abstract:   (11460 Views)

This article presents the application of two algorithms: heuristic big bang-big crunch (HBB-BC) and a heuristic particle swarm

ant colony optimization (HPSACO) to discrete optimization of reinforced concrete planar frames subject to combinations of

gravity and lateral loads based on ACI 318-08 code. The objective function is the total cost of the frame which includes the cost

of concrete, formwork and reinforcing steel for all members of the frame. The heuristic big bang-big crunch (HBB-BC) is based

on BB-BC and a harmony search (HS) scheme to deal with the variable constraints. The HPSACO algorithm is a combination of

particle swarm with passive congregation (PSOPC), ant colony optimization (ACO), and harmony search scheme (HS)

algorithms. In this paper, by using the capacity of BB-BC in ACO stage of HPSACO, its performance is improved. Some design

examples are tested using these methods and the results are compared.

Full-Text [PDF 1912 kb]   (5162 Downloads)    
Type of Study: Research Paper | Subject: Structure- Concrete

Add your comments about this article : Your username or Email:
CAPTCHA

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2024 CC BY-NC 4.0 | International Journal of Civil Engineering

Designed & Developed by : Yektaweb