Solving a large-scale 3D packing problem with robot constraints

DOI10.1016/J.COR.2025.107373MaRDI QIDQ7237834zbMATH OpenFDO

Authors Sheng Zhang, Mengmeng Ding, Hui-Min Chen, Jiacheng Ren, Xiaoli Yue, Liang Chen

Publication date 4 May 2026

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2025.107373

zbMATH Keywords

3d bin packingimproved simulated annealing algorithmpacking automationrobotic arm

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
• A novel hybrid tabu search approach to container loading
• A reference length approach for the 3D strip packing problem
• A tree search method for the container loading problem with shipment priority
• A two-phase approach for single container loading with weakly heterogeneous boxes
• An effective shaking procedure for 2D and 3D strip packing problems
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• An improved typology of cutting and packing problems
• Cargo securing under multi-drop and axle weight constraints
• Exact solution techniques for two-dimensional cutting and packing
• Modeling soft unloading constraints in the multi-drop container loading problem
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• The exact solutions of several types of container loading problems
• Three-dimensional container loading models with cargo stability and load bearing constraints
• Three-dimensional packing of items with limited load bearing strength
• Variable neighborhood search
• Weight distribution considerations in container loading

This page was built for publication: Solving a large-scale 3D packing problem with robot constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7237834)