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

Graph representation for structural topology optimization using genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
31
0

Year Published

2005
2005
2017
2017

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 69 publications
(34 citation statements)
references
References 27 publications
0
31
0
Order By: Relevance
“…As an important alternative approach within this family, the powerlaw approach [7], which is also called the solid isotropic microstructure with penalization (SIMP) method [8] and originally introduced by Bendsøe [9], has got a fairly general acceptance in recent years [3] because of its computational efficiency and conceptual simplicity. However, it does not directly attack the original 0-1 problem [10] and thus tends to converge to a local optimal topology with blurry boundary or undesirable checkerboard patterns [3,6,10,11] or converge to an infeasible solution to the original 0-1 problem [12]. Since the problem of non-existence of solutions (ill-posedness) is not resolved, priori restrictions on the admissible design configurations such as a perimeter constraint, a gradient constraint or with filtering techniques [7,10] must be introduced [13].…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation
“…As an important alternative approach within this family, the powerlaw approach [7], which is also called the solid isotropic microstructure with penalization (SIMP) method [8] and originally introduced by Bendsøe [9], has got a fairly general acceptance in recent years [3] because of its computational efficiency and conceptual simplicity. However, it does not directly attack the original 0-1 problem [10] and thus tends to converge to a local optimal topology with blurry boundary or undesirable checkerboard patterns [3,6,10,11] or converge to an infeasible solution to the original 0-1 problem [12]. Since the problem of non-existence of solutions (ill-posedness) is not resolved, priori restrictions on the admissible design configurations such as a perimeter constraint, a gradient constraint or with filtering techniques [7,10] must be introduced [13].…”
Section: Introductionmentioning
confidence: 98%
“…Since the seminal work of Holland [24] and the comprehensive study of Goldberg [25], GAs have become an increasingly popular optimization tool for many areas of research. More recently, GAs have been gradually recognized as a powerful and robust stochastic global search method for structural topology optimization [6,11,[26][27][28][29][30][31][32][33][34][35][36][37].…”
Section: Introductionmentioning
confidence: 99%
“…The use of graph theory for GAs is one of the new developments in structural optimization problem. Wang and Tai [41] devised a graph representation for the topology-related design variables in structural optimization problems. Kaveh and Kalatjari [42] utilized the graph theory for representation of the size-related design variables and force method for structural analysis.…”
Section: Evolutionary-based Optimization Studiesmentioning
confidence: 99%
“…Genetic algorithms (GAs) are a class of stochastic relaxation techniques that are applicable to the solution of a wide variety of optimization engineering problems [1][2][3][4][5][6][7][8][9][10] by emanating the evolutionary behaviour of biological systems. They are global optimizers due to their population search.…”
Section: Introductionmentioning
confidence: 99%