ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A robust dual algorithm for topology design of structures in discrete variables

Jog, CS (2001) A robust dual algorithm for topology design of structures in discrete variables. In: International Journal for Numerical Methods in Engineering, 50 (7). pp. 1607-1618.

[img] PDF
page180.pdf
Restricted to Registered users only

Download (290kB) | Request a copy

Abstract

Dual optimization algorithms for the topology optimization of continuum structures in discrete variables are gaining popularity in recent times since, in topology design problems, the number of constraints is small in comparison to the number of design variables. Good topologies can be obtained for the minimum compliance design problem when the perimeter constraint is imposed in addition to the volume constraint. However, when the perimeter constraint is relaxed, the dual algorithm tends to give bad results, even with the use of higher-order finite element models as we demonstrate in this work. Since, a priori, one does not know what a good value of the perimeter to be specified is, it is essential to have an algorithm which generates good topologies even in the absence of the perimeter constraint. We show how the dual algorithm can be made more robust so that it yields good designs consistently in the absence of the perimeter constraint. In particular, we show that the problem of checkerboarding which is frequently observed with the use of lower-order finite elements is eliminated.

Item Type: Journal Article
Publication: International Journal for Numerical Methods in Engineering
Publisher: John Wiley & Sons, Ltd.
Additional Information: The copyright belongs to John Wiley & Sons, Ltd.
Keywords: topology optimization;continuum structures;discrete variables
Department/Centre: Division of Mechanical Sciences > Mechanical Engineering
Date Deposited: 07 Feb 2006
Last Modified: 19 Sep 2010 04:23
URI: http://eprints.iisc.ac.in/id/eprint/5317

Actions (login required)

View Item View Item