Abstract

AbstractTopology optimization methodologies typically use the same discretization for the design variable and analysis meshes. Analysis accuracy and expense are thus directly tied to design dimensionality and optimization expense. This paper proposes leveraging properties of the Heaviside projection method (HPM) to separate the design variable field from the analysis mesh in continuum topology optimization. HPM projects independent design variables onto element space over a prescribed length scale. A single design variable therefore influences several elements, creating a redundancy within the design that can be exploited to reduce the number of independent design variables without significantly restricting the design space. The algorithm begins with sparse design variable fields and adapts these fields as the optimization progresses. The technique is demonstrated on minimum compliance (maximum stiffness) problems solved using continuous optimization and genetic algorithms. For the former, the proposed algorithm typically identifies solutions having objective functions within 1% of those found using full design variable fields. Computational savings are minor to moderate for the minimum compliance formulation with a single constraint, and are substantial for formulations having many local constraints. When using genetic algorithms, solutions are consistently obtained on mesh resolutions that were previously considered intractable. Copyright © 2009 John Wiley & Sons, Ltd.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.