z-logo
Premium
Part consolidation for additive manufacturing: A multilayered topology optimization approach
Author(s) -
Crispo Luke,
Kim Il Yong
Publication year - 2021
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.6754
Subject(s) - initialization , topology optimization , consolidation (business) , mathematical optimization , computer science , multi objective optimization , domain (mathematical analysis) , engineering , engineering drawing , topology (electrical circuits) , mathematics , structural engineering , finite element method , mathematical analysis , accounting , electrical engineering , business , programming language
Part consolidation (PC) is becoming a viable cost savings approach due to the increased design freedom associated with industry adoption of additive manufacturing. However, there is little research focused on mathematical approaches for assembly level design generation, with most work aimed at providing best practices for merging several parts into one. This article presents a novel topology optimization approach to PC that determines the ideal number of parts, their geometry, and optimal joining pattern, without bias towards the original assembly. Multiple layered design domains are created, and a joining domain that determines the connections between parts is introduced. A multiobjective problem statement optimizes the complex trade‐off between compliance, support structure volume, surface area, and number of joints, to minimize the total cost of the final assembly. Design variable initialization and boundary condition placement are discussed for problems with multiple domains. Three test cases are presented and solved for a range of cost trade‐offs to demonstrate optimized solutions as design objectives are varied.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here