.png){kind=icon}
.png){kind=icon}
Return
A bilevel integer programming method for blended composite structures
.png){kind=icon}
PRE
AI
DOI：10.1016/j.advengsoft.2014.08.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a new approach for the design of a composite structure. This approach is formulated as an optimization problem where the weight of the structure is minimized such that a reserve factor is higher than a threshold. The thickness of each region of the structure is optimized together with its stacking sequence and the ply drop-offs. The novelty of this approach is that, unlike in common practice, the optimization problem is not simplified and split into two steps, one for finding the thicknesses and one for the stacking sequence. The optimization problem is solved without any simplification assumption. It is formulated as a bilevel integer programming and it uses the backtracking procedure to satisfy the blending and the manufacturing rules. Some numerical experiments are performed to show the efficiency of the proposed optimization method over complex cases which cannot be solved with the existing methods. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Integer programming
Bilevel optimization
Backtracking
Composite structures
Design rules
Structural optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.