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

9Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Beyer, F., Schneider, D., & Schumacher, A. (2021). Finding three-dimensional layouts for crashworthiness load cases using the graph and heuristic based topology optimization. Structural and Multidisciplinary Optimization, 63(1), 59–73. https://doi.org/10.1007/s00158-020-02768-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free