A topology and sizing optimisation method for lightweight sandwich structures subject to dynamic and static constraints

A static-dynamic topology-sizing optimisation method is presented. The solution is based on a sequential Mixed-Integer Linear Programming solution and aims to minimise the mass of a structure subjected to concurrent constraints on static and dynamic response. It is shown that the classical problem o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Composite structures Jg. 348; S. 118442
Hauptverfasser: Larsson, Johan, Göransson, Peter, Wennhage, Per
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 15.11.2024
Schlagworte:
Mixed integer programming
Multifunctional structures
Sandwich structures
TOBS
Topology optimisation
Topology optimisation
Mixed integer programming
TOBS
Multifunctional structures
Sandwich structures
ISSN:0263-8223, 1879-1085
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A static-dynamic topology-sizing optimisation method is presented. The solution is based on a sequential Mixed-Integer Linear Programming solution and aims to minimise the mass of a structure subjected to concurrent constraints on static and dynamic response. It is shown that the classical problem of the dynamics of lightweight sandwich structures may be mitigated through core topology and face sheet thickness combinations, retaining the static load carrying capacity while presenting stringent dynamic properties at a low mass penalty. A numerical example, in the form of a load carrying sandwich beam which is excited at different frequencies, is used to demonstrate the method. •A topology-sizing optimisation method for lightweight sandwich materials is presented.•A constraint on the static compliance ensures the sandwich load carrying capacity.•The mass minimisation problem involves both core topology and face sheet thickness.•The optimisation is reformulated as a mixed integer linear programming problem.•Examples show that stringent dynamic constraints may be met at low mass penalty.
ISSN:0263-8223
1879-1085
DOI:10.1016/j.compstruct.2024.118442