2012
DOI: 10.1016/j.compstruc.2012.07.014
|View full text |Cite
|
Sign up to set email alerts
|

An exponential big bang-big crunch algorithm for discrete design optimization of steel frames

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0
1

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 61 publications
(24 citation statements)
references
References 14 publications
0
23
0
1
Order By: Relevance
“…18.11, i.e., x new ¼ x c , the generation process is iterated in the same way by decreasing the k parameter of the exponential distribution by half each time, and this is repeated until a different solution is produced, i.e., x new 6 ¼ x c . Hasançebi and Azad (2012) presented two numerical examples to investigate the performance of EBB-BC and MBB-BC. Compared with standard BB-BC, the improved variants gave the better results in terms of balancing between the exploration and exploitation characteristics of the algorithms.…”
Section: Improved Bb-bc Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…18.11, i.e., x new ¼ x c , the generation process is iterated in the same way by decreasing the k parameter of the exponential distribution by half each time, and this is repeated until a different solution is produced, i.e., x new 6 ¼ x c . Hasançebi and Azad (2012) presented two numerical examples to investigate the performance of EBB-BC and MBB-BC. Compared with standard BB-BC, the improved variants gave the better results in terms of balancing between the exploration and exploitation characteristics of the algorithms.…”
Section: Improved Bb-bc Algorithmmentioning
confidence: 99%
“…To improve the BB-BC performance, Hasançebi and Azad (2012) proposed two enhanced variants of the BB-BC algorithm, called modified BB-BC (MBB-BC) and exponential BB-BC algorithm (EBB-BC), respectively. In the new formulation, the normal random number (r) is changed by using any appropriate statistical distribution in order to eliminate the shortcomings of the standard formulation (e.g., big search dimensionality).…”
Section: Improved Bb-bc Algorithmmentioning
confidence: 99%
“…ICA [25], CSS [30] and IRO [31] algorithms found the best solution after 6,000, 7,000 and 18,300 structural analyses, respectively. ALC-PSO and HALC-PSO achieved the optimum design after 10,000 and 13,000 structural (22) analyses, respectively. However, they can obtain the ICA and IRO optimized designs after about 5,500 structural analyses and CSS optimized designs after about 7,000 structural analyses.…”
Section: Spatial 120-bar Dome Shaped Trussmentioning
confidence: 99%
“…For example, Sonmez [18] utilized artificial bee colony, Degertekin and Hayalioglu [19] employed teaching-learningbased optimization, Hosseini et al [20] used multi objective particle swarm optimization and Ho-Huu et al [21] utilized an adaptive elitist differential evolution for optimization of the truss structures. Hasançebi and Kazemzadeh Azad [22] used exponential big bang-big crunch algorithm, Toǧan [23] employed teaching-learning based optimization and Hasançebi and Carbas [24] utilized bat inspired algorithm for size optimization of steel frames. Optimization results are compared to those of some other meta-heuristic algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…where θ is a constant, N 0, 1 is a random number according to a standard normal distribution, and ε is the iteration number [48].…”
Section: Discrete Black Hole Algorithmmentioning
confidence: 99%