Browse State-of-the-Art › 3D Bin Packing

3D Bin Packing

4 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28

Miscellaneous

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.

Papers archive 2025-07-28

archive papers tagged: 11 · with a code link: 4 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 11 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 11 of 11, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.

  • 31 Aug 2021 2 repositories listed
    In this problem, the items are delivered to the agent without informing the full sequence information.
  • 29 Sep 2021 1 repository listed
    PCT 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 listed
    We solve a challenging yet practically useful variant of 3D Bin Packing Problem (3D-BPP).
  • 8 Jul 2019 1 repository listed
    This is particularly true for its practical variant, the mixed-case palletization problem, where item support is needed.
  • Deliberate Planning of 3D Bin Packing on Packing Configuration Trees
    6 Apr 2025 0 repositories listed
    Online 3D Bin Packing Problem (3D-BPP) has widespread applications in industrial automation.
  • ASAP: Learning Generalizable Online Bin Packing via Adaptive Selection After Pruning
    29 Jan 2025 0 repositories listed
    Recently, deep reinforcement learning (DRL) has achieved promising results in solving online 3D Bin Packing Problems (3D-BPP).
  • Adjustable Robust Reinforcement Learning for Online 3D Bin Packing
    6 Oct 2023 0 repositories listed
    Designing effective policies for the online 3D bin packing problem (3D-BPP) has been a long-standing challenge, primarily due to the unpredictable nature of incoming box sequences and stringent physical constraints.
  • Online 3D Bin Packing Reinforcement Learning Solution with Buffer
    15 Aug 2022 0 repositories listed
    The 3D Bin Packing Problem (3D-BPP) is one of the most demanded yet challenging problems in industry, where an agent must pack variable size items delivered in sequence into a finite bin with the aim to maximize the…
  • A Generalized Reinforcement Learning Algorithm for Online 3D Bin-Packing
    1 Jul 2020 0 repositories listed
    We propose a Deep Reinforcement Learning (Deep RL) algorithm for solving the online 3D bin packing problem for an arbitrary number of bins and any bin size.
  • A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem
    17 Apr 2018 0 repositories listed
    A 3D flexible bin packing problem (3D-FBPP) arises from the process of warehouse packing in e-commerce.
  • Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method
    20 Aug 2017 0 repositories listed
    In this paper, a new type of 3D bin packing problem (BPP) is proposed, in which a number of cuboid-shaped items must be put into a bin one by one orthogonally.

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