Shape and Topology Optimization for Complicated Engineering StructuresView this Special Issue
Research Article | Open Access
Improved Genetic Algorithm with Two-Level Approximation Method for Laminate Stacking Sequence Optimization by Considering Engineering Requirements
Laminated composites have been widely applied in aerospace structures; thus optimization of the corresponding stacking sequences is indispensable. Genetic algorithms have been popularly adopted to cope with the design of stacking sequences which is a combinatorial optimization problem with complicated manufacturing constraints, but they often exhibit high computational costs with many structural analyses. A genetic algorithm using a two-level approximation (GATLA) method was proposed previously by the authors to obtain the optimal stacking sequences, which requires significantly low computational costs. By considering practical engineering requirements, this method possesses low applicability in complicated structures with multiple laminates. What is more, it has relatively high dependence on some genetic algorithm control parameters. To address these problems, now we propose an improved GA with two-level approximation (IGATLA) method which includes improved random initial design, adaptive penalty fitness function, adaptive crossover probability, and variable mutation probability, as well as enhanced validity check criterion for multiple laminates. The efficiency and feasibility of these improvements are verified with numerical applications, including typical numerical examples and industrial applications. It is shown that this method is also able to handle large, real world, industrial analysis models with high efficiency.
Due to the advantages of high strength-to-weight and high stiffness-to-weight ratios, laminated composites have been stimulated for wide use in aerospace structures. Optimization design of the corresponding stacking sequences is indispensable to make efficient use of the material properties [1–5]. For practical laminated structures, however, the basic ply thicknesses are fixed and the available choices of fiber orientation angles are limited to a small set of angles, such as 0°, ±45°, and 90°. Because of these manufacturing constraints, stacking sequence design then becomes a combinatorial problem of choosing the fiber direction from a permissible set for each ply.
Genetic algorithm (GA) has been preferred extensively to solve this problem [2–4, 6–8] which proves to be well suited for the stacking sequence optimization. With their random nature, genetic algorithms (GAs) could produce a variety of alternative designs with similar performance in repeated runs , providing the designer with a choice of alternatives. However, one major disadvantage of GAs is that they involve high computational costs in the evaluation of chromosomes. So many studies have concentrated on improving GA’s efficiency [3, 9–15]. Among these improvements, approximation concepts with the use of lamination parameters combined with GA have been preferred [11, 13, 16]. With lamination parameters, the problems are simplified and computational costs can be effectively reduced. However, specific programming needs to be developed for structural response analyses and optimal designs are limited to particular laminate configurations , consequently restricting their utility in practical engineering applications when lamination parameters are applied.
In a recent study, we have proposed a genetic algorithm using a two-level approximation (GATLA)  method for optimizing laminates stacking sequences. Essentially, this approach adopts an optimization strategy that the genetic algorithm is integrated within the sequential approximation optimization problems, without using any intermediate variables. This strategy involves only low computational costs and many near optimal solutions could be easily obtained.
For practical engineering stacking sequence optimizations, more than two laminates need to be optimized simultaneously, as practical aerospace structural components usually comprise multiple panels and the stacking sequences of them can remarkably affect structural mechanical properties like strength and stiffness performances [5, 19]. Even though the GATLA method has been deemed to be able to deal with the optimizations of multiple laminates in simple structures , it has not been extended to practical engineering optimizations with multiple laminates. Moreover, the standard GA used in the strategy has relatively high dependence on some genetic parameters, which brings the burden of determining control parameters to the designers or users. Additionally, computational efficiency is another main factor when dealing with optimization problems, especially for large-scale structures. Although the power of the proposed method is undeniable, it seems that there is still space for efficiency improvements.
Thus, in the present study, the main objective is to further improve the performance of this strategy and make it more applicable to address practical engineering problems efficiently. Firstly, the initial design point which was produced randomly was enhanced. Meanwhile, the standard genetic algorithm inside GATLA was modified with a new penalty scheme as well as adaptive crossover probability and variable mutation probability. Moreover, validity check criterion for individual designs when dealing with multiple laminates was also enhanced to further improve the algorithm performance. All of these improvements were firstly verified with numerical examples, and this new strategy was further applied in industrial engineering problems. Significant improvements were obtained with the utilization of these improvements, and the results also showed that this approach could be applied to complicated structures and obtain reasonable stacking sequences with good efficiency.
2. GATLA Method
The basic principles of GATLA method will be briefly described in this section. For more details the reader could refer to the literature .
2.1. Problem Formulation
To implement the optimization procedure, a ground laminate with arbitrarily given number of plies and permissible orientations, such as 0°, ±45°, and 90°, is needed before calculation. The corresponding discrete 0/1 variables will decide whether the ply in the ground laminate should be retained or not, and a continuous thickness variable is set for each layer. The concept of ground laminate is similar to the concept of ground structure proposed in truss topology optimization . By determining the existence and absence of truss elements in the ground structure, the optimal layout may be obtained. Back to the present study, some plies might be deleted firstly during the discrete-variable optimization. Furthermore, by increasing the ply thickness after the continuous-variable optimization, several plies might be added. Therefore, by deleting and adding plies to the ground laminate, the optimal stacking sequences could be obtained. The thickness variables seem redundant; however, from lots of calculations, the results of problems considering thickness variables are much better than those without thickness variables, which have been demonstrated in . Based on the ground laminate sequence, the optimization problem can be formulated as follows:where is the vector of ply thickness variables, is the vector of discrete 0/1 variables which represent the existence of each ply, denotes the total number of plies in the ground laminate, is the number of constraints, is the objective function, is the th constraint function, and are the upper and lower bounds on the th thickness variable , respectively, and is a very small value (usually 0.01 ) used to represent the thickness value of a removed ply. For example, if the ground laminate is given as [(0/±45/90)10]s, the total number of plies is 80, and by considering symmetry there are 40 thickness variables and 40 discrete variables . It can be seen that the symmetry constraint can be readily achieved by optimizing only one half of the laminate, and the other half would be obtained symmetrically. If the balanced requirement that the number of +45° plies should be equal to the number of −45° plies is also considered, it can be realized by enforcing the thickness variables of adjacent +45° and −45° plies in the ground laminate to link together. Moreover, it can be observed that the ply angles in the ground laminate should be selected from the permissible small set of angles. In the end of the optimization, the obtained optimal ply thicknesses need to be rounded to meet the requirement that the ply thickness should be integral multiples to the fixed basic ply thickness. To alleviate matrix cracking problems, it is also required that, in the laminate, there should be no more than four contiguous plies with the same fiber orientation, and it is realized with the use of a penalty term in the objective function, which is to be shown in (8). As for the structural response constraints, , they are incorporated into the objective function via penalty functions.
2.2. Global Optimization Strategy
The global optimization strategy is introduced based on problem (1). To solve this problem, firstly, a first-level approximate problem is constructed using the branched multipoint approximate (BMA) function, which is a piecewise function with two branches for conditions when the corresponding ply exists or is absent, respectively. In the th stage, the first-level approximate problem can be stated as follows:where and are the move limits of at the th stage, and are the approximate functions for objective and constraint functions in the th stage, respectively, which are created by using the BMA function with the information of the primal functions and their corresponding derivatives at multiple known points, and is the number of active constraints of the original problem (1). The BMA functions take the forms as follows:wherewhere represents the objective function or the constraint function , is the th known point, and is the number of points to be counted, bounded previously by max. The exponents and () are adaptive parameters used to control the nonlinearity of the approximation, which can be obtained from the following equations:
Since the first-level approximate problem involves both continuous and discrete variables, an optimization strategy is then proposed. Discrete variables (0/1 variables which represent the existence of each ply in the ground laminate) are optimized through GA based on the first-level approximation problem, and when calculating the fitness of the population continuous thickness variables of composite laminate layers are optimized (this procedure is named size optimization hereinafter) by solving the dual problem of the second-level approximation, which could significantly reduce the gene code length in the GA and improve the optimization efficiency and accuracy.
The standard GA is used here. During the process of GA, a constrained problem using an exterior penalty function is established firstly as follows:where is treated as a penalty term in the objective function to enforce the requirement that there should be no more than four contiguous plies with the same fiber orientation, which is to alleviate matrix cracking problems; is the exponent of the power, and it represents the number of stacks violating the 4-ply contiguity constraint; is the penalty parameter for this manufacturing constraint; is the penalty factor, denotes the penalty exponent (taken as 1 in this work), and and are the objective value and constraint values with respect to the optimal thicknesses of given stacking sequences, which are obtained from the process of solving a second-level approximate problem.
By randomly deleting plies form the given ground laminate, an initial population is generated at the beginning of GA . Each individual in the population represents a stacking sequence design, and related ply thickness variables are optimized when the fitness values are calculated. Corresponding to each individual which means a given ply orientation sequence, discrete variables in the first-level approximate problem are fixed and sizing variables of the plies whose corresponding discrete variables are zero will be removed. The deleted plies and related constraints will not exist. The internal sizing (i.e., ply thickness) optimization problem is then established and to address this problem the second-level approximate problem is formed by expanding the objective function and the constraint functions in the first-level approximate problem into linear Taylor series. In the th step it is stated as follows:where is the objective function at the th step, is the constraint function, and are obtained from the approximate expressions in (2), and are the move limits at the th step, and and are the upper and lower bounds at the th step.
Dual method is then utilized to deal with the second-level approximate problem. When the second-level approximate problem converges, the fitness of the population could be obtained and genetic algorithm operators are executed to solve the first-level approximate problem. After that, the design variables and the corresponding structural parameters are modified for the next full structural analysis and sensitivity analysis, and then go to the next design cycle.
The flow chart of the strategy is schematically demonstrated in Figure 1. In the end of the optimization procedure, the optimized ply thicknesses are rounded to meet the requirement that they should be integral multiples to the fixed basic ply thickness, and the layers with small value thickness will be removed. The standard GA mentioned previously is replaced with improvement schemes, as shown in Figure 1, which will be described in the next section.
3. Improvements to GATLA Method
3.1. Improved Random Initial Design
As stated in Section 2, the optimization process starts from the arbitrarily given ground laminate, with limited orientations and excessive plies. To produce an initial design based on the ground laminate, in the original GATLA method, each ply in the ground laminate is randomly deleted with a relatively high level of probability, for example, 0.9 or larger. Here, this probability is defined as the deleted-ply percentage for the initial design, designated DPID. However, this random operation will probably produce a design with zero plies kept, or in a slightly better condition, with one or two plies retained in the ground laminate. Even if the probability to delete each ply is given a smaller value, the case that zero or very few plies are kept is possible to happen.
In order to avoid the producing of the initial design with few plies, here, this random design process is improved. Firstly, the deleted-ply percentage for the initial design, that is, DPID, is multiplied by the total number of plies in the ground laminate, and the obtained product value is rounded to nearest integer. Next, each ply in the ground laminate is randomly deleted as before with the given probability. The number of removed plies is counted, and this amount is then compared with the obtained product value. If the amount of deleted plies is less than the rounded product value, this random produced design is identified as an appropriate initial design. Otherwise, if the number of deleted plies is larger, which means too many plies have been deleted from the ground laminate or even no ply is retained, this produced design then adds plies one by one until the amount of deleted plies is fewer than the rounded product value to be identified as an appropriate initial design. For example, when the ground laminate is [(0/±45/90)10]s and DPID is given as 0.9, the number of removed plies from the ground laminate should not be more than 72, that is, . If the generated initial design is [0/±45/0/90/±45]s, the number of kept plies is 14, and that of the removed plies is 66. So this design could be identified as an appropriate initial design to go to the next optimization step. However, if the random produced design is [0/±45]s, the amount of deleted plies is then 74, which is larger than 72. Then add plies to this design to generate an appropriate one that meets the requirement. For instance, [0/±45/0]s gets valid after adding 0-degree layer to the original design.
3.2. New Penalty Scheme in Objective Function
Optimization problems with constraints must be transformed into unconstrained ones as GA is an unconstrained optimization method. In the original GATLA, an exterior penalty function is used to achieve this. As is formulated in (8), penalty control parameters and are predefined constants and need to be adjusted according to different optimization problems. The appropriate selection of these parameters plays a crucial role in determining the computational efficiency.
Though various specific penalty schemes have been proposed (see the introduction in ), Barbosa and Lemonge developed an adaptive penalty function without any type of user defined penalty parameter. The objective function proposed with an adaptive penalty is written aswhereand represents the average value of the objective function over current population, is the violation of the th constraint of the individual design corresponding to , is the violation of the th constraint averaged over the current population, and is the number of total constraints.
The main feature of this penalty scheme, besides being adaptive and not requiring any predefined parameter, is to automatically define a different penalty coefficient which varies along the run according to the feedback received from the evolutionary process for each constraint. The adaptive scheme also relieves the user from the burden of having to determine, by trial and error, sensitive parameters to cope with every new constrained optimization problem.
Based on this approach, an alternative penalty function was proposed in , which also has the same features as (10). Herein, we utilize the consistent type of this formulation  but replace the corresponding exponent (i.e., 3) with Figure 2 based on our numerical studies, as established in (12). Furthermore, the optimal design could be considered as the one with the largest possible constraint margin of all individuals of the same objective function . Therefore, a small fraction of the critical constraint value is subtracted from the objective function when all constraints are satisfied. In the present work, the ultimately new form of the unconstrained objective function with adaptive penalty scheme is defined as follows:whereand is the violation percent of the th constraint in the current population. is retained to enforce the 4-ply contiguity constraint and is the total number of same-orientations plies in excess of the four contiguously same-orientation plies. is employed here and we add to guarantee the small fraction is neither too small nor too large with respect to the object function value, which makes the function more adaptive. when the th constraint is satisfied and otherwise. The new objective function established here could automatically adjust the penalty to the infeasible designs from generation to generation and enhance the search capability to obtain a global optimum or get close to it. This adaptive penalty function enables two control parameters, and in (8), not to be given any more.
3.3. Adaptive Crossover and Variable Mutation Probabilities
In GA, crossover is used to produce new generation by combining a portion of each parent’s genetic string and mutation is adopted to add or delete genes by introducing small changes in children created by crossover. The efficiency of GA is often sensitive to the probabilities of crossover and mutation (hereafter referred to as and , resp.) , and the choice of both of them critically affects the performance as they are fixed constants in the standard GA. In practice, it is ideal to vary and adaptively by GA itself. Srinivas and Patnaik  proposed a method with adaptive probabilities of crossover and mutation to realize the twin goals of maintaining diversity in the population and sustaining the convergence capacity of GA. Moreover, an improved version of adaptive crossover and mutation operators was proposed by Ren and San . The modified expression for is as follows and is utilized in this paper:where is the maximum fitness value in the population, is the average fitness value in every population, and is the larger of the fitness values of the solutions to be crossed. In addition, we set and for each optimization problem. The modified formulation increases of the individuals with the highest fitness value up to , making the best individual no longer in a stagnant state.
The modified expression for proposed by Ren and San  is similar to that in (14), where is replaced by , which is the fitness of an individual. Thus, it means the calculation increases by obtaining the fitness of the current population generated after the crossover operator. Actually, it was observed that the use of relatively high mutation rates at the start of the GA-runs could be an efficient aim at preventing premature convergence . Thereafter, a very simple formulation to reduce the probability of mutation in geometric progression proposed by Leite and Topping  is adopted in this paper. By giving the initial probability of mutation and the final probability of mutation , the coefficient for the reduction of the mutation rate at each generation is determined bywhere is the maximum number of generations. In this study, we set and for each optimization problem. Thus, and do not need to be predefined anymore.
3.4. Enhanced Validity Check Criterion for Multiple Laminates
As is stated in Section 2, the optimization procedure is conducted by adding or deleting plies in the given ground laminate. In the process of GA, with the randomness of the initial population and GA operators, there may be some infeasible designs with invalid coding due to the excess removal of plies. Some individuals of these designs may be able to meet all the constraints after size optimization, that is, solving the second-level approximate problems. However, for designs with seriously overmuch removal of plies, even after the size optimization, they may remain serious constraint violations, consequently affecting the convergence to some extent. So there is no more need to perform the second-level approximation to these individuals and their fitness values could be directly set to be zero, which could improve the algorithm efficiency as a result. With regard to this, in GATLA, a validity check criterion was put forward for each individual coding. The criterion is that, for each encoded design, when the value of deleted plies is less than a certain percentage relative to corresponding ground laminate, this individual coding can be considered as valid and size optimization afterwards is conducted to achieve the fitness calculation; otherwise, this coding is identified to be invalid and zero is diametrically given to its fitness value without further size optimization. The ratio for this earlier stated judgment is defined as the maximum percentage permissible to delete layers, designated as FITP in  and this paper. This parameter should be initially given on the basis of ground laminate layers to guarantee the optimal design included. To illustrate this judgmental procedure, an example is shown in Figure 2. The number of plies in a ground laminate is 5, FITP = 0.8, and the coding is considered valid when the deleted plies are fewer than 4 (i.e., ).
However, deficiency could occur during the implementation of multiple laminates optimization. For example, if there are two laminates as design domain, one of them may be encoded with among the population, and the other’s coding could be . Apparently there are 12 plies in the ground laminate, and 8 plies are deleted for this individual. If FITP was given to be 0.8, this coding is identified to be valid according to the original criterion mentioned previously, for 8 is less than 9.6 (i.e., ). But no plies are reserved in the first laminate, and obviously this design should be considered invalid. With another three designs, this condition is shown in Figure 3.
Here, in order to overcome this shortcoming, the validity check criterion especially for multiple laminates is enhanced. First of all, the original criterion (OC) is implemented to the laminates one by one. When the coding design for each laminate is determined as valid, this individual could possess final validity identification. For the design with two laminates previously mentioned, according to the enhanced criterion (EC), less than 4.8 (i.e., ) plies should be removed in each laminate to be judged as valid. See Figure 4 to describe this scheme. It can be easily seen that both original and enhanced criteria are identical for dealing with just one laminate design. These validity checks essentially mean rejecting some designs out of the second-level optimization to improve the algorithm performance.
4. Numerical Examples
Numerical examples are conducted in this section to test the improvements by comparing with the original GATLA method. As the GA is a stochastic process, the algorithm performance will be evaluated in terms of reliability and normalized computation price. In this study, the indicator of the normalized price is the average number of evaluations of the structural analysis divided by the reliability of reaching a practical optimum after 200 independent runs here, while the reliability is defined as the fraction of runs that produced a practical optimum during the 200 repeated runs.
4.1. A Composite Cone-Cylinder Structure
The first example deals with the optimization of symmetric stacking sequences of a composite cone-cylinder structure, as shown in Figure 5, which consists of two composite parts: a conic part and a cylindrical part. The dimensions are mm, mm, mm, and mm. The two ends of the structure are fixed, with outer surfaces under a pressure of Mpa. The material is shown in Table 1, and the 0° fiber direction is along the longitudinal direction of the cone and cylinder. The objective is to minimize the weight of the whole structure. The constraints are Hz and , where is the first-order frequency of the structure and is the critical buckling factor, respectively.
The ground laminates were given as [(0/45/−45)10]s for the conic part and [(0/45/−45/90)7/0/45]s for the cylindrical part. Due to the restrictions on the manufacturing process in which the thickness of one layer could not be lower than , the lower and upper bounds on ply thickness were set as and , and the thickness of a removed ply was . In addition, DPID = 0.95 and FITP = 0.8. The best designs are known with 6 plies for the conic part and 8 plies for the cylindrical part, both referring to half of the laminates. The practical optima for this problem are designed as the feasible designs within -ply weights of the cylindrical part for half of both laminates of the global optimum. Some stacking sequences of the practical optima obtained with the proposed strategy are shown in Table 2, with ply thicknesses not rounded. As for the rounded results, they are not discussed in this section when making comparisons between methods.
The performance of the original method (GATLA) and GATLA method with the improvements described previously (IGATLA) was compared based on different population sizes and maximum generation numbers. With 200 runs for each case, the optimization results are shown in Table 3, and, in the GATLA method, the standard GA was used with and , . From the results in Table 3, it could be seen that the computation costs could be significantly reduced, and the reliability is increased to a high level of around 90%. For example, in the population size of 20 and maximum generations of 60, the normalized computation price is reduced about 75.4% while the reliability is increased by 21%.
4.2. A Two-Patch Panel
The second example for a two-patch panel stacking sequence optimization  is selected to further demonstrate the efficiency of IGATLA method, with minimum weight as objective and critical buckling factor not less than 0.76 as constraint under the loading N/mm. This structure consists of three laminates, two identical laminates along the edges, shown in Figure 6. The plate is simply supported on its edges and all four external edges remain straight. The composite material properties are also shown in Table 1. The best designs have been known with 24 plies for the exterior laminate and 8 plies for the interior part. The practical optima here are defined as the feasible designs within -ply weights for one half of the exterior/interior laminate of the global optimum. 200 independent optimization runs are performed to show the computational performance.
Starting with [(0/45/−45)5]s and [(−45/45/90)2]s as the ground laminates for the exterior and interior part, respectively, the optimization is conducted with 200 repeated runs, where the population size and maximum generation number are both 100; DPID = 0.28 and FITP = 0.96. Table 4 lists several practical optima obtained with GATLA method. It shows that this strategy is effective in dealing with stacking sequence optimization and more near optimal designs can be provided for the designer. Table 5 compares the efficiency of the GATLA and IGATLA methods, as well as the number of finite element analysis in . It can be seen that whether with improvements or not the GATLA approach exhibits lower computational costs, and by directly dealing with stacking sequences and thicknesses of each ply no intermediate variables like lamination parameters in  are used. Additionally, with the improvements in the GATLA method, the normalized computational cost is reduced from 17.80 to 8.56. So the computational cost saves 51.9% with these improvements. It could be concluded that noticeable improvements in the computational cost are obtained, and meanwhile a higher level of feasibility is achieved.
|A: after rounding, B: before rounding; #: critical buckling factor in reference, and ##: value given by Nastran.|
5. Engineering Applications
5.1. A Missile Rudder Structure Component Design
The first industrial application is to design the stacking sequence of a structural component from the missile rudder, which is to show the applicability of optimizing practical structures. The simplified geometry model and its dimensions are shown in Figure 7, and the length units are all millimeter, that is, mm. The semicircle region with a radius of 21.6 mm at the bottom is fixed, and a uniform distributed force with the total value of 5000 N is applied along the red line, 72 mm away from the bottom edge. The applied force is perpendicular to the surface of the composite plate. The properties of the composite materials are also shown in Table 1, and the 0-degree fibre direction is along the direction. The objective is to minimize the weight of the composite plate. The constraint is that the maximum displacement of the whole structure should not be more than 3 mm.
The optimization parameters are , , , DPID = 0.95, and FITP = 0.9. Three optimization cases are studied based on three different ground laminates: [(0/±45/90)25]s (Case ), [(±45/0/90)25]s (Case ), and [(0/±45/90)20]s (Case ). In Case , there are 100 continuous thickness variables and 100 discrete variables. For Case , the number of design variables is equal to that of Case . The difference between them is the sequences in the ground laminates. Compared with Cases and , fewer variables are involved in Case , that is, 80 thickness variables and 80 discrete variables. Considering the balanced constraint, the thickness variables of adjacent +45° and −45° plies are linked together in all three cases. The population size and generation number are 100 and 150, respectively. The optimization results obtained from the three cases are summarized in Table 6, where the thickness-rounded design results and not rounded designs are the same. With certain errors allowed, these results are acceptable, providing alternatives for the designer. Moreover, it can be seen that the proposed method is also effective starting with different ground laminates, which shows its robustness and applicability in dealing with practical structures.
5.2. A Satellite Structure Design
To further verify the practicality of the developed optimization system in engineering applications, the stacking sequences of the main cylinder in a satellite are optimized to provide the designer with a choice of alternatives. All of the calculations are conducted in a computer with CPU 3.30 GHz/RAM 8.00 G.
A satellite structure is composed of two parts: the main structure platform and the payload cabin. It is connected with the launch vehicle through a joint ring in the bottom of the main structure platform. In the main structure platform, a main cylinder with a conic part and a cylindrical part is designed, the stacking sequence of which needs to be optimized. The stiffness of the whole satellite should satisfy the requirement that the first-order natural transverse frequency, , is not lower than 15 Hz. Meanwhile, the design should also meet the stability demand that under each launch condition load, listed in Table 7, the critical buckling factor should not be less than 1.5.
Based on the primal design of the satellite structure, an FE (finite element) model was established with Patran, and the FE model of the main structure platform is shown in Figure 8, with a side panel and payload cabin removed. The main cylinder is also shown in Figure 8. Based on the connecting interface between the satellite and launch vehicle, the boundary condition is to fix the bottom of the joint ring.
In the optimization calculation, the ground laminate was given as [(0/±45/90)5]s for the cylindrical part, with [(0/±45)6]s for the conic part. And 0° fiber direction is along the longitudinal direction of the main cylinder. For the composite material properties in the design space, they are listed in Table 1. Considering the balanced constraint requirement that the number of +45° plies should be equal to the number of −45° plies, the thickness variables of adjacent +45° and −45° plies are enforced to link together here. The population size and maximum generation number in GA are 80 and 60, respectively. Among the constraints, the first-order natural transverse frequency, , and critical buckling factor under Load Case , , are set as constraint functions which will be satisfied automatically during the optimum calculation. Critical buckling factors under the other three load cases act as measurements to verify the optimized structure. The objective is to seek the minimum weight. Table 8 shows several optimization results of the stacking sequences with ply thicknesses not rounded. As the deleted piles with 0.01t-thickness are removed completely here for structural analyses in Table 8, a few critical buckling factors are a bit less than 1.5.
According to the results shown in Table 8, the stacking sequences are redesigned next by rounding the thicknesses and adding one or more plies if needed to meet the design requirements. The redesigned results are presented in Table 9, and it can be found that the stiffness and the stability of the final solutions basically satisfy all the design constraints, which provided guidelines to the detailed design of the satellite structure. Besides, as could be seen in Table 8, less than twenty-five structural analyses were implemented during the whole process for these five result cases, which means that this optimization strategy can supply reasonable solutions efficiently even for large-scale engineering problem.
By considering practical engineering requirements, the genetic algorithm using a two-level approximation devised in previous work for stacking sequence optimization was improved in the present study, and the performance was investigated with more typical numerical examples and industrial applications. With these improved optimization strategies including improved random initial design, adaptive penalty fitness function, adaptive crossover probability, and variable mutation probability, as well as enhanced validity check criterion for multiple laminates, significantly higher computational efficiency and reliability than before have been obtained, which also relieve the designers from the burden of determining several control parameters. Meanwhile, a wealth of near optimal designs could be produced easily as well. By applying this strategy in practical engineering problems, it has been found that reasonable stacking sequences have been obtained, and this method is capable of conducting practical engineering optimizations efficiently to provide the designer with a choice of alternatives.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
The authors acknowledge the support of this research work received from the National Natural Science Foundation of China (Grant no. 11102009).
- H. Fukunaga and H. Sekine, “Stiffness design method of symmetric laminates using lamination parameters,” AIAA Journal, vol. 30, no. 11, pp. 2791–2793, 1992.
- R. Le Riche and R. T. Haftka, “Optimization of laminate stacking sequence for buckling load maximization by genetic algorithm,” AIAA journal, vol. 31, no. 5, pp. 951–956, 1993.
- R. le Riche and R. T. Haftka, “Improved genetic algorithm for minimum thickness composite laminate design,” Composites Engineering, vol. 5, no. 2, pp. 143–161, 1995.
- B. Liu, R. T. Haftka, M. A. Akgün, and A. Todoroki, “Permutation genetic algorithm for stacking sequence design of composite laminates,” Computer Methods in Applied Mechanics and Engineering, vol. 186, no. 2–4, pp. 357–372, 2000.
- A. Todoroki and M. Sekishiro, “New iteration fractal branch and bound method for stacking sequence optimizations of multiple laminates,” Composite Structures, vol. 81, no. 3, pp. 419–426, 2007.
- J. H. Park, J. H. Hwang, C. S. Lee, and W. Hwang, “Stacking sequence design of composite laminates for maximum strength using genetic algorithms,” Composite Structures, vol. 52, no. 2, pp. 217–231, 2001.
- M. Cho and S. Y. Rhee, “Layup optimization considering free-edge strength and bounded uncertainty of material properties,” AIAA Journal, vol. 41, no. 11, pp. 2274–2282, 2003.
- M. Shakeri, M. H. Yas, and M. Ghasemi Gol, “Optimal stacking sequence of laminated cylindrical shells using genetic algorithm,” Mechanics of Advanced Materials and Structures, vol. 12, no. 4, pp. 305–312, 2005.
- S. Nagendra, D. Jestin, Z. Gürdal, R. T. Haftka, and L. T. Watson, “Improved genetic algorithm for the design of stiffened composite panels,” Computers and Structures, vol. 58, no. 3, pp. 543–555, 1996.
- G. Soremekun, Z. Gürdal, R. T. Haftka, and L. T. Watson, “Improving genetic algorithm efficiency and reliability in the design and optimization of composite structures,” Tech. Rep. TR-96-13, Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, Va, USA, 1996.
- B. Liu, R. T. Haftka, and M. A. Akgün, “Composite wing structural optimization using genetic algorithms and response surfaces,” in Proceedings of the 7th AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, pp. 1–12, St. Louis, Mo, USA, 1998.
- V. B. Gantovnik, Z. Gürdal, and L. T. Watson, “A genetic algorithm with memory for optimal design of laminated sandwich composite panels,” Composite Structures, vol. 58, no. 4, pp. 513–520, 2002.
- A. Todoroki and T. Ishikawa, “Design of experiments for stacking sequence optimizations with genetic algorithm using response surface approximation,” Composite Structures, vol. 64, no. 3-4, pp. 349–357, 2004.
- P. Kere and J. Lento, “Design optimization of laminated composite structures using distributed grid resources,” Composite Structures, vol. 71, no. 3-4, pp. 435–438, 2005.
- C. H. Park, W. I. Lee, W. S. Han, and A. Vautrin, “Improved genetic algorithm for multidisciplinary optimization of composite laminates,” Computers and Structures, vol. 86, no. 19-20, pp. 1894–1903, 2008.
- K. Yamazaki, “Two-level optimization technique of composite laminate panels by genetic algorithms,” in Proceedings of the 37th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference and Exhibit, pp. 1882–1887, AIAA, Salt Lake City, Utah, USA, 1996.
- H. Ghiasi, D. Pasini, and L. Lessard, “Optimum stacking sequence design of composite materials Part I: constant stiffness design,” Composite Structures, vol. 90, no. 1, pp. 1–11, 2009.
- S. Chen, Z. Lin, H. An, H. Huang, and C. Kong, “Stacking sequence optimization with genetic algorithm using a two-level approximation,” Structural and Multidisciplinary Optimization, vol. 48, no. 4, pp. 795–805, 2013.
- A. Todoroki and M. Sekishiro, “Stacking sequence optimization to maximize the buckling load of blade-stiffened panels with strength constraints using the iterative fractal branch and bound method,” Composites Part B: Engineering, vol. 39, no. 5, pp. 842–850, 2008.
- M. Ohsaki, “Genetic algorithm for topology optimization of trusses,” Computers & Structures, vol. 57, no. 2, pp. 219–225, 1995.
- H. J. C. Barbosa and A. C. C. Lemonge, “A new adaptive penalty scheme for genetic algorithms,” Information Sciences, vol. 156, no. 3-4, pp. 215–251, 2003.
- X. Liu, G. Cheng, J. Yan, and L. Jiang, “Singular optimum topology of skeletal structures with frequency constraints by AGGA,” Structural and Multidisciplinary Optimization, vol. 45, no. 3, pp. 451–466, 2012.
- M. Srinivas and L. M. Patnaik, “Adaptive probabilities of crossover and mutation in genetic algorithms,” IEEE Transactions on Systems, Man and Cybernetics, vol. 24, no. 4, pp. 656–667, 1994.
- Z.-W. Ren and Y. San, “Improved adaptive genetic algorithm and its application research in parameter identification,” Journal of System Simulation, vol. 18, no. 1, pp. 41–43, 2006.
- J. P. B. Leite and B. H. V. Topping, “Improved genetic operators for structural engineering optimization,” Advances in Engineering Software, vol. 29, no. 7–9, pp. 529–562, 1998.
- F.-X. Irisarri, M. M. Abdalla, and Z. Gürdal, “Improved shepard's method for the optimization of composite structures,” AIAA Journal, vol. 49, no. 12, pp. 2726–2736, 2011.
Copyright © 2015 Haichao An et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.