Browse State-of-the-Art › 3D Bin Packing
3D Bin Packing
4 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
As a classic NP-hard problem, the bin packing problem (1D-BPP) seeks for an assignment of a collection of items with various weights to bins. The optimal assignment houses all the items with the fewest bins such that the total weight of items in a bin is below the bin’s capacity. In its 3D version (3D-BPP), an item has a 3D “weight” corresponding to its length, width and height.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
4 shown of 4 papers with code (11 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
31 Aug 2021 2 repositories listedIn this problem, the items are delivered to the agent without informing the full sequence information.
-
29 Sep 2021 1 repository listedPCT is a full-fledged description of the state and action space of bin packing which can support packing policy learning based on deep reinforcement learning (DRL).
-
26 Jun 2020 1 repository listedWe solve a challenging yet practically useful variant of 3D Bin Packing Problem (3D-BPP).
-
8 Jul 2019 1 repository listedThis is particularly true for its practical variant, the mixed-case palletization problem, where item support is needed.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections