A Comparison of Stacking Sequence Optimization Schemes;Genetic Algorithm and Branch and Bound Method

적층순서 최적화 알고리듬의 평가;유전 알고리듬과 분기법

Stacking sequence optimization needs discrete programming techniques because ply angles are limited to a fixed set of angles such as $0^{\circ},\;{\pm}45^{\circ},\;90^{\circ}$. Two typical methods are genetic algorithm and branch and bound method. The goal of this paper is to compare the methods in the light of their efficiency and performance in handling the constraints and finding the global optimum. For numerical examples, maximization of buckling load is used as objective and optimization results from each method are compared.