Abstract
A bit-array representation method for structural topology optimization using the GA is proposed. The importance of design connectivity is further emphasized and a hierarchical violation penalty method is proposed to penalize the violated constraint functions so that the problem of representation degeneracy can be overcome and the GA search can be driven towards the combination of better structural performance, less unusable material and fewer connected objects in the design domain. An identical initialization method is also proposed to test the performance of the GA operators. With the appropriately selected GA operators, the bit-array representation GA is applied to the structural topology optimization problems of minimum weight. Numerical results demonstrate that the present GA can achieve better accuracy with less computational cost and suggest that the GA performance can be significantly improved by handling the design connectivity properly.
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.
