Abstract
In this note, globally optimal solutions to three sets of small-scale discretized continuum topology optimization problems are presented. All the problems were discretized by the use of nine-node isoparametric finite elements. The idea is that these solutions can be used as benchmark problems when testing new algorithms for finding pure 0–1 solutions to topology optimization problems defined on discretized ground structures.
Similar content being viewed by others
References
Cook RD, Malkus DS, Plesha ME, Witt RJ (2002) Concepts and applications of finite element analysis, 4th edn. Wiley, New York
Stolpe M (2004) Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch-and-bound. Int J Numer Methods Eng 61:1270–1309
Svanberg K, Werme M (2005) Topology optimization by sequential integer linear programming. In: Proceeding of IUTAM topoptSYMP2005, Rungstedgaard, Copenhagen, 26–29 October 2005
Svanberg K, Werme M (2005) A hierarchical neighbourhood search method for topology optimization. Struct Multidisc Optim 29(5):325–340
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Werme, M. Globally optimal benchmark solutions to some small-scale discretized continuum topology optimization problems. Struct Multidisc Optim 32, 259–262 (2006). https://doi.org/10.1007/s00158-006-0015-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00158-006-0015-0