Mixed-integer second-order cone programming for global optimization of compliance of frame structure with discrete design variables

Frame structures are extensively used in mechanical, civil, and aerospace engineering. Besides generating reasonable designs of frame structures themselves, frame topology optimization may serve as a tool providing us with conceptual designs of diverse engineering structures. Due to its nonconvexity...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Structural and multidisciplinary optimization Ročník 54; číslo 2; s. 301 - 316
Hlavný autor: Kanno, Yoshihiro
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2016
Springer Nature B.V
Predmet:
Aerospace engineering
Algorithms
Computational Mathematics and Numerical Analysis
Continuity (mathematics)
Design optimization
Engineering
Engineering Design
Frame structures
Global optimization
Heuristic methods
Integers
Local optimization
Nonlinear programming
Research Paper
Theoretical and Applied Mechanics
Topology optimization
Discrete optimization
Global optimization
Frame topology optimization
Second-order cone programming
Mixed-integer programming
ISSN:1615-147X, 1615-1488
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Frame structures are extensively used in mechanical, civil, and aerospace engineering. Besides generating reasonable designs of frame structures themselves, frame topology optimization may serve as a tool providing us with conceptual designs of diverse engineering structures. Due to its nonconvexity, however, most of existing approaches to frame topology optimization are local optimization methods based on nonlinear programming with continuous design variables or (meta)heuristics allowing some discrete design variables. Presented in this paper is a new global optimization approach to the frame topology optimization with discrete design variables. It is shown that the compliance minimization problem with predetermined candidate cross-sections can be formulated as a mixed-integer second-order cone programming problem. The global optimal solution is then computed with an existing solver based on a branch-and-cut algorithm. Numerical experiments are performed to examine computational efficiency of the proposed approach.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1615-147X
1615-1488
DOI:10.1007/s00158-016-1406-5