Stacking sequence optimization with genetic algorithm using a two-level approximationReport as inadecuate

Stacking sequence optimization with genetic algorithm using a two-level approximation - Download this document for free, or read online. Document in PDF available to download.

Structural and Multidisciplinary Optimization

, Volume 48, Issue 4, pp 795–805

First Online: 07 April 2013Received: 13 July 2012Revised: 04 March 2013Accepted: 14 March 2013


We propose a new method for laminate stacking sequence optimization based on a two-level approximation and genetic algorithm GA, and establish an optimization model including continuous size variables thicknesses of plies and discrete variables 0-1 variables that represent the existence of each ply. To solve this problem, a first-level approximate problem is constructed using the branched multipoint approximate BMA function. Since mixed-variables are involved in the first-level approximate problem, a new optimization strategy is introduced. The discrete variables are optimized through the GA. When calculating the fitness of each member in the population of GA, a second-level approximate problem that can be solved by the dual method is established to obtain the optimal thicknesses corresponding to the each given ply orientation sequence. The two-level approximation genetic algorithm optimization is performed starting from a ground laminate structure, which could include relatively arbitrarily discrete set of angles. The method is first applied to cylindrical laminate design examples to demonstrate its efficiency and accuracy compared with known methods. The capacity of the optimization strategy to solve more complex problems is then demonstrated using a design example. With the presented method, the stacking sequence in analytical tools can be directly taken as design variables and no intermediate variables need be adopted.

KeywordsStacking sequence Optimum design Approximation Genetic algorithm Composites  Download fulltext PDF

Author: Shenyan Chen - Zhiwei Lin - Haichao An - Hai Huang - Changduk Kong


Related documents