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

G. Canale, P. Weaver, F. Rubino, A. Maligno, R. Citarella
{"title":"Lay-up Optimization of Laminated Composites Using a Modified Branch and Bound Method","authors":"G. Canale, P. Weaver, F. Rubino, A. Maligno, R. Citarella","doi":"10.2174/1874155X01812010138","DOIUrl":null,"url":null,"abstract":"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).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.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.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.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.","PeriodicalId":267392,"journal":{"name":"The Open Mechanical Engineering Journal","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Open Mechanical Engineering Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2174/1874155X01812010138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

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).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.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.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.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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于改进分支定界法的层合复合材料铺层优化
复合材料广泛应用于航空航天、船舶和汽车工业。它们的主要优点之一是它们的堆叠顺序可以定制,以最大化/最小化特定的结构性能。对于厚度最小化或保持恒定(即厚度和层向百分比是预先确定的)的复合材料层压板,总是需要高效且计算成本不高的算法来找到最佳堆叠顺序;因此,优化的问题是排列性的。本文提出了一种改进的分支定界算法,用于确定单目标和多目标优化问题的叠加顺序。层压板厚度和方向百分比要么是变量,要么是先验确定的(因此优化问题是排列的)。与其他元启发式技术相比,计算时间大大减少。本文提出的方法是在Kim和Hwang[10]的基础上改进的分支定界算法。主要的新颖之处在于优化序列的起点:由“理想”层形成的层压板,在本文中描述。首先用具有固定厚度和层向固定百分比的层压板测试改进的分支和束缚。研究了三个不同的问题:固有频率最大化、尖端挠度最小化和屈曲临界载荷最大化。其次,该算法还对屈曲和强度约束下的重量最小化问题进行了测试。与遗传算法相比,MBB具有良好的保真度和显著的计算优势。尽管数值例子中的结构很简单,但预计MBB可以用于确定多部分结构的铺层。用该方法确定了若干问题的叠加顺序。改进的分支定界法被证明可以确定好的层压板设计,并提供显著的效率节约。“好的设计”在这里被定义为通过最小化计算量来产生“接近全局最优”适应度值的解决方案。结果表明,对于不存在竞争的单目标,得到了全局最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Wear and Corrosion Resistance of Hardened Fe-Al-Mn Grinding Ball Revised Lewis Bending Stress Capacity Model The Efficient and Tentative Model for Extenics Replications of the Moveable Robots Controllable Magnetoactive Polymer Conduit Experimental Studying of the Variations of Surface Roughness and Dimensional Accuracy in Dry Hard Turning Operation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1