Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/17218
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPetrovic, Nenad-
dc.contributor.authorKostic, Nenad-
dc.contributor.authorMarjanovic, Nenad-
dc.date.accessioned2023-03-13T12:16:50Z-
dc.date.available2023-03-13T12:16:50Z-
dc.date.issued2017-
dc.identifier.issn2466-4677en_US
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/17218-
dc.description.abstractThe complex problem of truss structural optimization, based on the discrete design variables assumption, can be approached through optimizing aspects of sizing, shape, and topology or their combinations. This paper aims to show the differences in results depending on which aspect, or combination of aspects of a standard 10 bar truss problem is optimized. In addition to standard constraints for stress, cross section area, and displacement, this paper includes the dynamic constraint for buckling of compressed truss elements. The addition of buckling testing ensures that the optimal solutions are practically applicable. An original optimization approach using genetic algorithm is verified through comparison with literature, and used for all the optimization combinations in this research. The resulting optimized model masses for sizing, shape, and topology or their combinations are compared. A discussion is given to explain the results and to suggest which combination would be best in a generalized example.en_US
dc.language.isoenen_US
dc.publisher“The Serbian Academic Center” Novi Sad The Association of Intellectuals for the Development of Science in Serbiaen_US
dc.relation.ispartofApplied Engineering Lettersen_US
dc.subjectstructural optimizationen_US
dc.subjectgenetic algorithmen_US
dc.titleCOMPARISON OF APPROACHES TO 10 BAR TRUSS STRUCTURAL OPTIMIZATION WITH INCLUDED BUCKLING CONSTRAINTSen_US
dc.typearticleen_US
Appears in Collections:Faculty of Engineering, Kragujevac

Page views(s)

62

Downloads(s)

24



Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.