Genetic Algorithm with Memory for Optimal Design of Laminated Sandwich Composite Site Panels

Abstract

This paper is concerned with augmenting genetic algorithms (GAs) to include memory for continuous variables, and applying this to stacking sequence design of laminated sandwich composite panels that involves both discrete variables and a continuous design variable. The term “memory” implies preserving data from previously analyzed designs. A balanced binary tree with nodes corresponding to discrete designs renders efficient access to the memory. For those discrete designs that occur frequently, an evolving database of continuous variable values is used to construct a spline approximation to the fitness as a function of the single continuous variable. The approximation is then used to decide when to retrieve the fitness function value from the spline and when to do an exact analysis to add a new data point for the spline. With the spline approximation in place, it is also possible to use the best solution of the approximation as a local improvement during the optimization process. The demonstration problem chosen is the stacking sequence optimization of a sandwich plate with composite face sheets for weight minimization subject to strength and buckling constraints. Comparisons are made between the cases with and without the binary tree and spline interpolation added to a standard genetic algorithm. Reduced computational cost and increased performance index of a genetic algorithm with these changes are demonstrated.