English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper we present a new procedure using the graph and heuristic based topology optimization in order to find layouts for three-dimensional frame structures under crash loads. A three-dimensional graph describes the geometry and is used to derive a finite element shell model. The model of the frame structure consists of different profiles with continuous cross-sections. The ends of the profiles are currently rigidly connected. Each cross-section is defined by an individual two-dimensional graph. After performing a simulation its results are used by competing heuristics to propose new topologies for the frame structure. Most of these heuristics are derived from expert knowledge. Over several iterations, the goal is to improve the structures mechanical behavior. Typical objectives are the minimization of the structural intrusion in a crash scenario or the minimization of the maximal contact force between structural components. The presented method includes topology optimization by heuristics and shape optimization respectively sizing by mathematical optimization algorithms. The new flexible syntax for three- and two-dimensional graphs, the optimization process and the currently used heuristics are described. The performance is demonstrated for two examples, each optimized twice with opposing objectives.

Finding three-dimensional layouts for crashworthiness load cases using the graph and heuristic based topology optimization