Abstract
In this study, a new ground-structure-based representation for truss topology optimization is proposed. The proposed representation employs an algorithm that removes unwanted elements from trusses to obtain the final trusses. These unwanted elements include kinematically unstable elements and useless zero-force elements. Since the element-removal algorithm is used in the translation of representation codes into corresponding trusses, this results in more representation codes in the search space that are mapped into kinematically stable and efficient trusses. Since more representation codes in the search space represent stable and efficient trusses, the strategy increases meaningful competition among representation codes. This remapping strategy alleviates the problem of having large search spaces using ground structures, and encourages faster convergences. To test the effectiveness of the proposed representation, it is used with a simple multi-population particle swarm optimization algorithm to solve several truss topology optimization problems. It is found that the proposed representation can significantly improve the performance of the optimization process.
Published Version
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.
