Abstract

A truss is a collection of axially loaded structural elements connected through pin joints. Optimization of truss structures indicates the determination of best possible conditions that are necessary for achieving the most economical design in terms of lowest possible weights of the truss elements. According to recent studies, Size, Topology and Shape based optimizations are the three possible independent optimization scopes for finding the optimum weight of a truss. The current study focuses on the size optimization of truss structure and aims to identify the most cost-effective sections of the truss using a powerful evolutionary optimization technique named as Genetic Algorithm (GA). Here single point cross over method and bit wise mutation operator are adopted for expanding the search space with the assigned displacement and stress constraints. Fortran based sub routines are developed for each individual steps of GA such as fitness evaluation, selection, cross-over and mutation. Finaly the complete program is run for validation of its outcome. While comparing with the solution of an existing literature regarding a minimization of objective function having two design variables the outcomes tend to show a good correlation. Further, the study is extended for the weight minimization of two widely used truss having 10 members and 17 members respectively with standard Finite Element Method of analysis. Minimum weight of each truss is obtained via convergence plot and compared with the existing literatures. With this simple but efficient global optimization technique optimum weight of truss structure can easily be achieved.

Full Text
Paper version not known

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.