A novel global optimization method of truss topology

This paper proposes a global topology optimization algorithm based on subset simulation for the singular optimum problem subject to stress constraints of trusses.The constraints are handled by a fitness function which reflects their degree of violation.The rational and global topology results are gu...

Full description

Saved in:
Bibliographic Details
Published inScience China Technological Sciences Vol. 54; no. 10; pp. 2723 - 2729
Main Authors Wang, Qi, Lu, ZhenZhou, Tang, ZhangChun
Format Journal Article
LanguageEnglish
Published Heidelberg SP Science China Press 01.10.2011
Subjects
Algorithms
China
Computer simulation
Engineering
Fitness
Judgments
Optimization
Topology
Trusses
优化算法
优化问题
健身功能
全局最优
应力约束
拓扑优化
最优问题
桁架
singular optimum
topology optimization
subset simulation
global optimization
truss
Online AccessGet full text
ISSN1674-7321
1869-1900
1862-281X
DOI10.1007/s11431-011-4552-4

Cover

More Information
Summary:This paper proposes a global topology optimization algorithm based on subset simulation for the singular optimum problem subject to stress constraints of trusses.The constraints are handled by a fitness function which reflects their degree of violation.The rational and global topology results are guaranteed by the judgment of the samples＇ rationality and the Metropolis-Hasting algorithm.Three examples show that the established method can quickly reduce the searching region to the feasible region and converge to the global optimum precisely enough for the singular optimum problem.
Bibliography:topology optimization; truss; subset simulation; singular optimum; global optimization
This paper proposes a global topology optimization algorithm based on subset simulation for the singular optimum problem subject to stress constraints of trusses.The constraints are handled by a fitness function which reflects their degree of violation.The rational and global topology results are guaranteed by the judgment of the samples＇ rationality and the Metropolis-Hasting algorithm.Three examples show that the established method can quickly reduce the searching region to the feasible region and converge to the global optimum precisely enough for the singular optimum problem.
WANG Qi,LU ZhenZhou＊ ＆ TANG ZhangChun School of Aeronautics,Northwestern Polytechnical University,Xi＇an 710072,China
11-5845/TH
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1674-7321
1869-1900
1862-281X
DOI:10.1007/s11431-011-4552-4