A Practical Algorithm for Packing Tubes and Boxes
Jo\~ao Pedro Pedroso, Jo\~ao Nuno Tavares, Jorge Leite

TL;DR
This paper presents a practical recursive algorithm for efficiently packing tubes and boxes into containers by dividing the space into holders, considering object characteristics and placement rules for timely solutions.
Contribution
It introduces a novel recursive packing method that accounts for object-specific constraints, improving packing efficiency for tubes and boxes.
Findings
Provides a practical algorithm for container packing
Handles unique object characteristics and placement rules
Delivers timely packing solutions
Abstract
In this paper we describe a method for packing tubes and boxes in containers. Each container is divided into parts (holders) which are allocated to subsets of objects. The method consists of a recursive procedure which, based on a predefined order for dealing with tubes and boxes, determines the dimensions and position of each holder. Characteristics of the objects to pack and rules limiting their placement make this problem unique. The method devised provides timely and practical solutions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · Advanced Manufacturing and Logistics Optimization · Computational Geometry and Mesh Generation
