[en] To prevent numerical instabilities associated with the mesh-dependence, checkerboards and grey regions in topology optimization, a variant perimeter-constrained version of the SIMP algorithm is proposed using a smooth and quadratic function. In order to have an efficient implementation and to make sure the strict satisfaction of such an upper-bound perimeter constraint, a diagonal quadratic approximation of the perimeter constraint is used in the construction of each explicit optimization subproblem. The latter is then solved by a dual sub-iteration scheme. Numerical results show that the incorporation of such a sub-iteration scheme leads to a convergent solution without needs of move-limits or artificial control parameters. In addition to this, it is found that successive relaxations of the perimeter constraint by increasing the upper-bound tend to regularize the topology solution and result in a checkerboard free and satisfactory design solution without grey regions.
Disciplines :
Mechanical engineering
Author, co-author :
Zhang, Weihong
Duysinx, Pierre ; Université de Liège - ULiège > Département d'aérospatiale et mécanique > Ingénierie des véhicules terrestres
Language :
English
Title :
Dual approach using a variant perimeter constraint and efficient sub-iteration scheme for topology optimization
Publication date :
2003
Journal title :
Computers and Structures
ISSN :
0045-7949
Publisher :
Pergamon-Elsevier Science Ltd, Oxford, United Kingdom
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
Bibliography
Bendsoe M.P., Kikuchi N. Generating optimal topologies in optimal design using a homogenization method. Comput. Meth. Appl. Mech. Eng. 71:1988;197-224.
Kohn R.V., Strang G. Optimal design and relaxation of variational problems. Commun. Pure Appl. Math. 39:1986.
Diaz A.R., Sigmund O. Checkerboard patterns in layout optimization. Struct. Optim. 10:1995;40-45.
Ambrosio L., Buttazzo G. An optimal design problem with perimeter penalization. Calculus Variations Partial Different. Equat. 1:1993;55-69.
Haber R.B., Jog C.S., Bendsoe M.P. Variable-topology shape optimization with a control on perimeter. Proceedings of the 20th Design Automation Conference, Minneapolis, USA. De-vol. 69.2:1994;261-272 ASME publication.
Haber R.B., Jog C.S., Bendsoe M.P. A new approach to variable-topology shape design using a constraint on perimeter. Struct. Optim. 11:1996;1-12.
Petersson J, Beckers M, Duysinx P. Almost isotropic perimeters in topology optimization: Theoretical an numerical aspects. In: Proceedings of the 3th world congress of structural and multidisciplinary optimization (Wcsmo-3), 1999, Buffalo, NY, USA, 09-TOM1-1.
Petersson J. Some convergence results in perimeter-controlled topology optimization. Comput. Meth. Appl. Mech. Eng. 171:1999;123-140.
Sigmund O. Design of material structures using topology optimization. PhD thesis, Technical University of Denmark, Denmark, 1994.
Petersson J., Sigmund O. Slope constrained topology optimization. Int. J. Numer. Meth. Eng. 41:1998;1417-1434.
Zhou M., Shyy Y.K., Thomas H.L. Checkerboard and minimum member size control in topology optimization. Struct. Multidisc Optim. 21:2001;152-158.
Rozvany G.I.N. Aims, scope, methods, history and unified terminology of computer-aided topology optimization in structural mechanics. Struct. Multidisc Optim. 21:2001;90-108.
Duysinx P. Optimisation topologique: du milieu continu a la structure elastique. PhD thesis, University of Liege, Belgium, 1996.
Duysinx P. Layout optimization: a mathematical programming approach. LTAS-Report OA-41, University of Liege, Belgium, 1996.
Beckers M. Optimisation de structures en variables discretes. PhD thesis, University of Liege, Belgium, 1997.
Jog C.S. A robust dual algorithm for topology design of structures in discrete variables. Int. J. Numer. Meth. Eng. 50(7):2001;1607-1618.
Jog C.S. Topology design of structures using a dual algorithm and a constraint on the Perimeter. Int. J. Numer. Meth. Eng. 54(7):2002;1007-1019.
Zhang W.H., Fleury C., Duysinx P., Nguyen V.H., Laschet I. A generalized method of moving asymptotes (GMMA) including equality constraints. Struct. Optim. 12:1996;143-146.
This website uses cookies to improve user experience. Read more
Save & Close
Accept all
Decline all
Show detailsHide details
Cookie declaration
About cookies
Strictly necessary
Performance
Strictly necessary cookies allow core website functionality such as user login and account management. The website cannot be used properly without strictly necessary cookies.
This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.
Performance cookies are used to see how visitors use the website, eg. analytics cookies. Those cookies cannot be used to directly identify a certain visitor.
Used to store the attribution information, the referrer initially used to visit the website
Cookies are small text files that are placed on your computer by websites that you visit. Websites use cookies to help users navigate efficiently and perform certain functions. Cookies that are required for the website to operate properly are allowed to be set without your permission. All other cookies need to be approved before they can be set in the browser.
You can change your consent to cookie usage at any time on our Privacy Policy page.