Abstract
A packing problem for irregular 3D objects approximated by polyhedra is presented. The objects have to be packed into a cuboid of minimum height under continuous rotations, translations and minimum allowable distances between objects. The problem has various applications and arises, e.g. in additive manufacturing. Containment, distance and non-overlapping constraints are described using the phi-function technique. The irregular packing problem is formulated in the form of nonlinear programming problem. A solution algorithm is proposed based on a fast starting point algorithm and efficient local optimization procedure.
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.
