Topology optimization of compliant mechanisms / Otimização topologica de mecanismos flexiveis

AUTOR(ES)
DATA DE PUBLICAÇÃO

2009

RESUMO

In this work, we study some possible formulations for the topology optimization problem of a compliant mechanism, proposed by Nishiwaki et al. [33], Lima [26] and Sigmund [37]. To solve the nonlinear programming problem associated to each formulation, we use a globally convergent version of the Sequential Linear Programming, inspired in the Gomes et al. [18] work, and a globally convergent version of the Method of Moving Asymptotes, developed by Svanberg [46]. We make a comparative analysis of the performance of these two optimization methods, with respect to the optimum topologies obtained for the structures and to the computational e ort for the resolution of the topology optimization problems. Also, we compare the e ciency of some spatial lters already proposed in the literature, used to avoid the occurrency of regions similar to a checkerboard in the optimum topology of the structures

ASSUNTO(S)

programação não-linear otimização matematica mathematical optimization otimização topologica nonlinear programming topology optimization

Documentos Relacionados