455 Stacking Sequence Optimizations of Composite Laminates with Fractal Branch and Bound Method : Application to complicated structures using in-plane and out-of-plane lamination parameters

2001 ◽  
Vol 2001.14 (0) ◽  
pp. 513-514
Author(s):  
Akira Todoroki ◽  
Yuichirou Terada
Keyword(s):  
Branch And Bound ◽  
Composite Laminates ◽  
Stacking Sequence ◽  
Branch And Bound Method ◽  
Lamination Parameters ◽  
Out Of Plane

scholarly journals Lay-up Optimization of Laminated Composites Using a Modified Branch and Bound Method

2018 ◽  
Vol 12 (1) ◽  
pp. 138-150 ◽  
Author(s):  
Giacomo Canale ◽  
Paul M. Weaver ◽  
Felice Rubino ◽  
Angelo Maligno ◽  
Roberto Citarella
Keyword(s):  
Branch And Bound ◽  
A Priori ◽  
Computational Effort ◽  
Branch And Bound Algorithm ◽  
Computational Time ◽  
Stacking Sequence ◽  
Branch And Bound Method ◽  
Starting Point ◽  
Global Optima ◽  
Laminate Thickness

Background:Composite materials are widely used in the aerospace, marine and automotive industries. One of their main advantages is that their stacking sequence can be tailored to maximise/minimise a specific structural performance. Efficient and non-computational-expensive algorithms are always needed to find the optimum stacking sequence of a composite laminate whose thickness is either to be minimised or may be kept constant (i.e.the thickness and the plies orientation percentages are pre-determined; the problem of the optimisation is therefore permutational).Objective:A modified branch and bound algorithm is proposed here and used to determine the stacking sequence for single and multi-objective optimisation problems. Laminate thickness and orientation percentages are either variables or determined a priori (the optimisation problem is therefore permutational). Computational time is drastically reduced when compared with other meta-heuristic techniques.Methods:The proposed method is a branch and bound algorithm, modified from the original work proposed by Kim and Hwang [10]. The main novelty is the starting point of the optimisation sequence: a laminate formed by “Ideal” layers, described in this paper.Results:The modified branch and bound has been first tested with a laminate having fixed thickness and a fixed percentage of layer orientation. Three different problems have been investigated: maximisation of natural frequencies, minimisation of tip deflection and maximisation of buckling critical load. The algorithm has been also tested, secondly, for a problem of weight minimisation subjected to buckling and strength constraints.Conclusion:The MBB has been shown to give good fidelity and significant computational advantages compared with a GA. Despite the simplicity of the structures in the numerical examples, it is anticipated that the MBB can be used to determine lay-ups in multi-part structures. The method was used to determine stacking sequences for several problems. The modified branch and bound method was shown to determine good laminate designs and offer significant efficiency savings.A “Good Design” is here defined as a solution producing “Near Global Optima” fitness values by minimising the computational effort. It was shown that for a single objective without ply competition, global optima were obtained.

scholarly journals Stacking Sequence Optimizations Using Fractal Branch and Bound Method for Laminated Composites

2001 ◽  
Vol 44 (4) ◽  
pp. 490-498 ◽  
Author(s):  
Yuichiro TERADA ◽  
Akira TODOROKI ◽  
Yoshinobu SHIMAMURA
Keyword(s):  
Branch And Bound ◽  
Laminated Composites ◽  
Stacking Sequence ◽  
Branch And Bound Method
Sign in / Sign up

Export Citation Format

Share Document