Abstract
In this paper a revised algorithm, derived by the Stud GA, to optimize the stacking sequence of layered composite structures is presented. The constrained combinatorial problem is formulated and hence solved by means of the algorithm presented herein. Unlike the Stud GA, the proposed algorithm uses a fitness-proportionate selection to find potential mates to the Stud and a self-adaptive extinction to avoid premature convergence. Elitism is also allowed. Standard benchmark problems have been used to fully assess the validity of the proposed algorithm. Results in terms of reliability and efficiency are compared against three GAs and a Permutation Search (PS) algorithm. It has been demonstrated, by means of a parametric study, that a low probability of extinction is sufficient to ensure fast convergence as well as reliable results. Finally the optimization of a more complex aeronautic structure is addressed aiming to prove the validity of the proposed algorithm in a two level optimization strategy. Results in terms of efficiency are compared against those of an in-house standard GA.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
