Sequential permutation table method for optimization of stacking sequence in composite laminates

A framework for design and optimization of tapered composite structures. Part II: Enhanced design framework with a global blending model

“…Various heuristic algorithms were adopted to deal with this problem, such as an improving hit-and-run (IHR) algorithm [2], a genetic algorithm (GA) [3][4][5][6][7][8][9][10][11][12]24,25,27,30,31], an ant-colony optimisation (ACO) [14], an evolutionary algorithm (EA) [26,28,29], etc. Specific computational techniques were developed for stacking-sequence design, especially focusing on the blending issue: various parameterization techniques [13,15,28,29], a backtracking method [16][17][18], an outer approximation method for stacking-sequence design coupled with a level set method for layer-shape optimization [32], a global shared-layer blending (GSLB) method [20], a permutation search (PS) [21], and a sequential permutation table method (SPT) [22], etc.…”

A framework for design and optimization of tapered composite structures. Part I: From individual panel to global blending structure

“…A new framework for design of tapered composite structures is proposed based on two techniques in [24,25]; the design concept is extending from an individual panel to the overall structure by improving its blending property. All complex constraints are considered, they are divided into different sets and implemented at various steps.…”

“…All complex constraints are considered, they are divided into different sets and implemented at various steps. A stacking sequence of individual panel is obtained by using sequential permutation table (SPT) [25] without considering a blending requirement. However, to maintain the maximal blending property, the GSLB method [24] is adopted.…”

“…Ply tailoring, numbers of plies and a stacking sequence are designed separately in three phases with manufacturing constraints divided and imposed in each phase. Most recently, Jing [23][24][25] developed algorithms based on a classical lamination theory (CLT) to solve stacking-sequence optimization problem. A permutation search (PS) algorithm [23] was developed for sequence optimization as well as a sequential permutation table (SPT) method [25], with the buckling load factor expressed as a linear function of a sum of buckling load factors at every stacking position corresponding to ply orientation.…”

“…Most recently, Jing [23][24][25] developed algorithms based on a classical lamination theory (CLT) to solve stacking-sequence optimization problem. A permutation search (PS) algorithm [23] was developed for sequence optimization as well as a sequential permutation table (SPT) method [25], with the buckling load factor expressed as a linear function of a sum of buckling load factors at every stacking position corresponding to ply orientation. Besides, a global shared-layer blending (GSLB) method [24] was proposed based on the SLB method [14] to identify layer shape/ maintain blending property according to the structural thickness distribution.…”