.png){kind=icon}
.png){kind=icon}
Return
A primal-dual backtracking optimization method for blended composite structures
.png){kind=icon}
PRE
AI
DOI：10.1007/s00158-011-0716-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A combinatorial optimization method is proposed for finding the optimal stacking sequence and the ply drop-offs of a blended composite structure. This method assumes that the thicknesses of the regions of the structure are fixed in advance. It is able to handle efficiently design and manufacturing rules which are of combinatorial type. The optimization problem is formulated as a constrained binary programming problem and it is solved by applying both a primal and a dual backtracking procedures with a local search method. Some numerical experiments are carried out to show the efficiency of the optimization method with respect to both computational time and quality criteria.
Keywords:
Combinatorial optimization
Primal-dual formulation
Backtracking
Composite structures
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
4.8K
Citations:
1.7W