Buckling optimization of laminated composite plates using genetic algorithm and generalized pattern search algorithm

In this paper, genetic algorithm and generalized pattern search algorithm are used for optimal stacking sequence of a composite panel, which is simply supported on four sides and is subject to biaxial in-plane compressive loads. The problem has several global optimum configurations in the vicinity o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Structural and multidisciplinary optimization Ročník 39; číslo 5; s. 477 - 486
Hlavní autoři: Karakaya, Şükrü, Soykasap, Ömer
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer-Verlag 01.11.2009
Springer Nature B.V
Témata:
Aspect ratio
Buckling
Composite structures
Computational Mathematics and Numerical Analysis
Engineering
Engineering Design
Genetic algorithms
Graphite fiber reinforced plastics
Graphite-epoxy composites
Optimization
Pattern search
Plates (structural members)
Production scheduling
Research Paper
Search algorithms
Stacking sequence (composite materials)
Theoretical and Applied Mechanics
Genetic algorithm
Composites
Optimization
ISSN:1615-147X, 1615-1488
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, genetic algorithm and generalized pattern search algorithm are used for optimal stacking sequence of a composite panel, which is simply supported on four sides and is subject to biaxial in-plane compressive loads. The problem has several global optimum configurations in the vicinity of local optima. The composite plate under consideration is 64-ply laminate made of graphite/epoxy. The laminate is taken to be symmetric and balanced, comprised of two-ply stacks with discrete fiber angles of 0 2 , ± 45, 90 2 in the laminate sequence. The critical buckling loads are maximized for several combinations of load case and plate aspect ratio, and are compared with published results. Performance of both algorithms is compared in terms of capability of identifying global optima. It is found that genetic algorithm is efficient for problems with global optima.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1615-147X
1615-1488
DOI:10.1007/s00158-008-0344-2