• Aucun résultat trouvé

Contributions to handle maximum size constraints in density-based topology optimization

N/A
N/A
Protected

Academic year: 2021

Partager "Contributions to handle maximum size constraints in density-based topology optimization"

Copied!
17
0
0

Texte intégral

(1)

University of Liège

Faculty of Applied Sciences

Aerospace and Mechanical Department

Contributions to handle maximum size constraints in density-based topology optimization

Eduardo Fernández* , Maxime Collet* , Simon Bauduin* , Etienne

Lemaire$ , Pierre Duysinx*

(2)

/ 17

Eduardo FERNANDEZ - ULG YIC 2017 2

Maximum size in the design process

INTRODUCTION

Optimized Cantilever beam under local damage scenarios , Jansen et al (2014).

Cantilever beam with maximum size and minimum gap control.

Design domain Minimum size Maximum size Indirect desired properties

Aesthetic reasons

(3)

Guest’s approach (2009)

Condition satisfied if

Guest (2009) Constraint:

Guest JK, Imposing maximum length scale in topology optimization, Struct Multidisc Optim, 37, 463-473, 2009.

(4)

/ 17

Eduardo FERNANDEZ - ULG YIC 2017 4

Maximum size formulation

Local Constraint : Compliance minimization with

maximum size constraints

(5)

Compliance minimization with maximum size constraints

Matrix with neighbors information

Voids vector with penalization

(6)

/ 17

Eduardo FERNANDEZ - ULG YIC 2017 6

Constraints distribution and aggregation

Iteration of the MBB beam with

maximum size constraints Satisfied

Violated

(7)

Aggregation functions: p-mean & p-norm

(8)

/ 17

Eduardo FERNANDEZ - ULG YIC 2017 8

Aggregation functions: p-mean & p-norm

Aggregation

(9)

Aggregation of maximum size constraints

(10)

/ 17

Eduardo FERNANDEZ - ULG YIC 2017 10

Aggregation of maximum size constraints

P-mean curves

Modification of the sensitivities to improve convergence

(11)

Addressed problems in linear elasticity

Compliance Minimization

Heat conduction

(12)

/ 17

Eduardo FERNANDEZ - ULG YIC 2017 12

MBB-beam with different mesh sizes

6144 Elements 55296 Elements P-mean P-norm Sept. 14, 2017

(13)

New test region

Circular

region Annular

(14)

/ 17

Eduardo FERNANDEZ - ULG YIC 2017 14

New test region

Circular

Annular Circular

Annular

(15)

Compliance minimization with maximum size Continuation procedure : SIMP Min imu m Siz e m siz e Time/Iter = Ref. Design Domain

(16)

/ 17

Eduardo FERNANDEZ - ULG

• Maximum size constraints where aggregated

using p-mean and p-norm functions.

• With p-norm is not possible to get

mesh-indenpent solutions.

The ring-shaped region reduces the amount of

holes in the design

• The aggregation reduces the computation time

compared to a highly constrained problem and allows to solve 3D problems in a reasonable time.

YIC 2017 16

Concluding remarks

(17)

Acknowledgement

Références

Documents relatifs

On the one hand, turning from traditional extraction of red oil palm into artisanal extraction using a small- scale mill does not affect the quality of the oil and significantly

Figure 1: a) Laser cladding process using coaxial injection of powders, b) Influence of coefficients of thermal expansion (CTE) on the residual stresses (ad: CTE of the coating, as:

When a size constraint is imposed on the spanning structures and a set of destinations should be connected to a source node, the optimal solution corresponds to a minimum cost

Different models can be obtained by considering additional constraints, in particular the local current and energy constraints (first and second or- der moments), which lead to

To illustrate this concept, a Fortran 2D finite element mechanical code and a C++ 2D finite element magnetic code are associated using this

To mitigate the phenomenon of overfitting we can either regularize by adding a penalty on the model in the cost function which would penalize the too strong oscillations

Despite the small size of some datasets, U-Net, Mask R- CNN, RefineNet and SegNet produce quite good segmentation of cross-section.. RefineNet is better in general but it

(2005) made a comparison between different methods to construct phylogenetic trees using a permutation either random or greedy for the initial solution, then they compared