Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Upper Bound Strategy in Optimum Design of Truss Structures: A Big Bang-Big Crunch Algorithm Based Application
Date
2013-06-01
Author
Kazemzadeh Azad, Saeid
Hasançebi, Oğuzhan
Kazemzadeh Azad, Sina
Erol, Osman Kaan
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
205
views
0
downloads
Cite This
One main shortcoming of metaheuristic search techniques in structural optimization is the large number of time-consuming structural analyses required for convergence to a reasonable solution. This study is an attempt to apply the so-called upper bound strategy (UBS) as a simple, yet an efficient strategy to reduce the total number of structural analyses through avoiding unnecessary analyses during the course of optimization. Although, the usefulness of the UBS is demonstrated in conjunction with a big bang-big crunch algorithm developed for optimum design of truss structures, it can be integrated with any other metaheuristic technique which works on the basis of (mu+lambda) evolutionary model. The numerical investigations over three benchmark truss optimization instances reveal that the UBS can reduce the total number of required structural analyses of the standard BB-BC algorithm to a great extent.
Subject Keywords
Structural design optimization
,
Metaheuristic search techniques
,
Big bang-big crunch algorithm
,
Upper bound strategy
,
Truss structures
URI
https://hdl.handle.net/11511/32921
Journal
ADVANCES IN STRUCTURAL ENGINEERING
DOI
https://doi.org/10.1260/1369-4332.16.6.1035
Collections
Department of Civil Engineering, Article
Suggestions
OpenMETU
Core
Upper bound strategy for metaheuristic based design optimization of steel frames
Kazemzadeh Azad, Saeid; Hasançebi, Oğuzhan; Kazemzadeh Azad, Sina (2013-03-01)
Optimum design of structural systems based on metaheuristic algorithms suffers from enormously time-consuming structural analyses to locate a reasonable design. In this paper an upper bound strategy (UBS) is proposed for reducing the total number of structural analyses in metaheuristic based design optimization of steel frame structures. The well-known big bang-big crunch algorithm as well as its two enhanced variants are adopted as typical metaheuristic algorithms to evaluate the effect of the UBS on compu...
Harmony search algorithms in structural engineering
Saka, M.P.; Aydogdu, I.; Hasançebi, Oğuzhan; Geem, Z.W. (2011-08-08)
Harmony search method is widely applied in structural design optimization since its emergence. These applications have shown that harmony search algorithm is robust, effective and reliable optimization method. Within recent years several enhancements are suggested to improve the performance of the algorithm. Among these Mandavi has presented two versions of harmony search methods. He named these as improved harmony search method and global best harmony search method. Saka and Hasancebi (2009) have suggested...
Discrete sizing optimization of steel trusses under multiple displacement constraints and load cases using guided stochastic search technique
Azad, S. Kazemzadeh; Hasançebi, Oğuzhan (2015-08-01)
The guided stochastic search (GSS) is a computationally efficient design optimization technique, which is originally developed for discrete sizing optimization problems of steel trusses with a single displacement constraint under a single load case. The present study aims to investigate the GSS in a more general class of truss sizing optimization problems subject to multiple displacement constraints and load cases. To this end, enhancements of the GSS are proposed in the form of two alternative approaches t...
Capacity controlled search: A new and efficient design-driven method for discrete size optimization of steel frames
Eser, Hasan; Hasançebi, Oğuzhan (2023-01-15)
This paper presents a new and efficient design-driven method, called the capacity controlled search (CCS) algorithm, which is developed to handle sizing optimization of especially large-scale steel frames under multiple strength and displacement constraints. The CCS algorithm implements an intelligent and probabilistic search strategy, where the maximum demand-to-capacity ratios (DCRs) calculated for member groups are used to guide the search process for a rapid convergence to the optimum solution. The prin...
Ant Colony Search Method in Practical Structural Optimization
Hasançebi, Oğuzhan (2011-06-01)
This paper is concerned with application and evaluation of ant colony optimization (ACO) method to practical structural optimization problems. In particular, a size optimum design of pin-jointed truss structures is considered with ACO such that the members are chosen from ready sections for minimum weight design. The application of the algorithm is demonstrated using two design examples with practical design considerations. Both examples are formulated according to provisions of ASD-AISC (Allowable Stress D...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Kazemzadeh Azad, O. Hasançebi, S. Kazemzadeh Azad, and O. K. Erol, “Upper Bound Strategy in Optimum Design of Truss Structures: A Big Bang-Big Crunch Algorithm Based Application,”
ADVANCES IN STRUCTURAL ENGINEERING
, pp. 1035–1046, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32921.