A Constructive Heuristic Algorithm for 3D Bin Packing of Irregular Shaped Items
Qiruyi Zuo, Xinglu Liu, Wai Kin Victor Chan

TL;DR
This paper introduces a heuristic algorithm for 3D bin packing of irregular, deformable items, improving space utilization and operational efficiency in logistics by considering shape-changing factors.
Contribution
It proposes a novel constructive heuristic that incorporates item deformability into 3D bin packing, addressing a gap in existing regular-shape-focused methods.
Findings
Higher space utilization with shape-changing factor
Potential cost savings in packaging and delivery
Enhanced operational efficiency
Abstract
The three-dimensional bin packing problem (3D-BPP) plays an important role in city logistics and manufacturing environments, due to its direct relevance to operational cost. Most existing literature have investigated the conventional 3D-BPP, in which the shape of items are typically considered as regular shapes, e.g., rectangular-shaped rigid boxes or cylindrical-shaped containers. However, 3D-BPP for non-rectangular shaped items are quite common in varies delivery schemes, especially in fresh food delivery, and few published studies focusing on these issues. In this paper, we address a novel 3D-BPP variant in which the shape changing factor of non-rectangular and deformable items is incorporated to further enhance the loading efficiency and reduce the operational cost of related companies. Motivated by the compression process of item-loading, we propose a constructive heuristic (i.e.,…
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 · Manufacturing Process and Optimization
