Abstract

The Big Bang-Big Crunch (BB-BC) algorithm is implemented to optimise lay-up configurations of filament wound laminated cylindrical pressure vessels subject to internal pressure. The vessels are composed of a combination of two different types of lamina, a chopped strand mat and a direct roving lamina with different fibre orientations. These two types of layers are combined into one discrete design variable, creating a complex discontinuous objective function surface. Two optimisation cases are presented, in the first case, the inverse of the Tsai-Wu Strength Ratio is minimised, and in the second case, a cost factor is introduced to shift the global minimum to a singularity. To assess the performance of the BB-BC algorithm, the results of the optimisation runs are compared with the global optimum obtained by a brute-force method. In this study, an analysis of the effect of varying the population size on the efficiency and accuracy of the results, is presented. In addition, the influence of previous best fit candidate on the performance of the algorithm is also investigated. It is shown that the BB-BC algorithm is robust in optimising layup sequences even when the number of layers is high and when two different types of layers are present. In particular, it is shown that higher population sizes increases the accuracy of the results although it lowers the efficiency. In the presence of a singularity in the objective function, it is necessary that the new generations subject to further optimisation represent more the previous best fit candidate.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.