Abstract
The paper studies a packing problem for ellipses placed into an arbitrary disconnected polygonal domain. Neither a number of ellipses nor their sizes are fixed. The objective is maximizing packing factor. The ellipses can be continuously translated and rotated. Restrictions on the dimensions of the ellipses are taken into account. Placement constraints (distance constraints between ellipses and containment of ellipses into a polygonal domain) are formulated using the phi-function technique. Resulting packing problem is stated in the form of MIP model that is equivalent to a sequence of NLP subproblems. A new solution approach is proposed combining a feasible starting point algorithm and an optimization procedure to search for efficient locally optimal solutions. The approach as an addition to existing topology optimization algorithms, can be used to automate design of parts for «support-free» additive manufacturing taking into account requirements of static and/or fatigue strength.
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 callDisclaimer: 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.
