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

Size optimization of space trusses using Big Bang–Big Crunch algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
109
0
3

Year Published

2012
2012
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 326 publications
(113 citation statements)
references
References 40 publications
1
109
0
3
Order By: Relevance
“…6) in different variants was performed in Refs. [7,10,16,44,[49][50][51] and in many other articles. This paper gives consideration to the condition of a 25-bar truss size optimization problem according to Ref.…”
Section: -Bar Space Trussmentioning
confidence: 93%
“…6) in different variants was performed in Refs. [7,10,16,44,[49][50][51] and in many other articles. This paper gives consideration to the condition of a 25-bar truss size optimization problem according to Ref.…”
Section: -Bar Space Trussmentioning
confidence: 93%
“…In order to overcome these drawbacks, we have implemented hybridization of BB-BC and some characteristics of Particle Swarm Optimization (PSO) proposed in [5] because this approach has been proven to be successful in solving different design problems [5,6]. PSO is optimization algorithm inspired by birds flocking or fish schooling in search for food [7,8], where every individual (particle) adjusts its movements according to both its own experience and the population experience.…”
Section: Optimization Methodsmentioning
confidence: 99%
“…PSO is optimization algorithm inspired by birds flocking or fish schooling in search for food [7,8], where every individual (particle) adjusts its movements according to both its own experience and the population experience. This feature has been used for modifying the BB-BC into hybrid BB-BC (HBB-BC) by using not only the center of mass from the previous generation (X c k ) but also the best position of a given individual solution up to iteration k (X lbest(k) ) and the best position in the whole population found up to the iteration k (X gbest(k) ) [5]:…”
Section: Optimization Methodsmentioning
confidence: 99%
“…These vary from focussing on a single aspect of the structure such as size, topology or shape optimization (Kaveh and Talatahari, 2009;Mohr et al, 2011;Wang et al, 2002), to a multilevel approach where individual aspects are considered sequentially (Miguel et al, 2013;Sobieszczanski-Sobieski et al, 1987) or a simultaneous approach where two or more aspects are considered together (Mortazavi and Toğan, 2016;Ahrari et al, 2015).…”
Section: Introductionmentioning
confidence: 99%