Bin Packing Optimization via Deep Reinforcement Learning
On the map: Deep reinforcement learning methods → RL for robot navigation and UAV control
Abstract (arXiv)
The Bin Packing Problem (BPP) has attracted enthusiastic research interest recently, owing to widespread applications in logistics and warehousing environments. It is truly essential to optimize the bin packing to enable more objects to be packed into boxes. Object packing order and placement strategy are the two crucial optimization objectives of the BPP. However, existing optimization methods for BPP, such as the genetic algorithm (GA), emerge as the main issues in highly computational cost and relatively low accuracy, making it difficult to implement in realistic scenarios. To well relieve the research gaps, we present a novel optimization methodology of two-dimensional (2D)-BPP and three-dimensional (3D)-BPP for objects with regular shapes via deep reinforcement learning (DRL), maximizing the space utilization and minimizing the usage number of boxes. First, an end-to-end DRL neural network constructed by a modified Pointer Network consisting of an encoder, a decoder and an attention module is proposed to achieve the optimal object packing order. Second, conforming to the top-down operation mode, the placement strategy based on a height map is used to arrange the ordered objects in the boxes, preventing the objects from colliding with boxes and other objects in boxes. Third, the reward and loss functions are defined as the indicators of the compactness, pyramid, and usage number of boxes to conduct the training of the DRL neural network based on an on-policy actor-critic framework. Finally, a series of experiments are implemented to compare our method with conventional packing methods, from which we conclude that our method outperforms these packing methods in both packing accuracy and efficiency.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in RL for robot navigation and UAV control, one of 15 directions in Deep reinforcement learning methods. Builds on 3 of its 31 references that are in the map. First posted on arXiv 19 Mar 2024.
Builds on
3 of 31 references.
References · 3
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025(X)-evolve: Solution space evolution powered by large language modelscited by 6
- 2026IG-RFT: An Interaction-Guided RL Framework for VLA Models in Long-Horizon Robotic Manipulationcited by 5
- 2025STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimizationcited by 3
- 2025One4Many-StablePacker: An Efficient Deep Reinforcement Learning Framework for the 3D Bin Packing Problemcited by 0
- 2026IG-RFT: An Interaction-Guided RL Framework for VLA Models in Long-Horizon Robotic Manipulation24 Feb 2026
- 2025One4Many-StablePacker: An Efficient Deep Reinforcement Learning Framework for the 3D Bin Packing Problem11 Oct 2025
- 2025(X)-evolve: Solution space evolution powered by large language models11 Aug 2025
- 2025STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization22 May 2025
Similar, not cited
Close in wording, no citation either way
- 2024An Efficient Deep Reinforcement Learning Model for Online 3D Bin Packing Combining Object Rearrangement and Stable Placement
- 2025A Hierarchical Bin Packing Framework with Dual Manipulators via Heuristic Search and Deep Reinforcement Learning
- 2024GOPT: Generalizable Online 3D Bin Packing via Transformer-based Deep Reinforcement Learning
- 2025Deliberate Planning of 3D Bin Packing on Packing Configuration Trees
- 2026Diffusion Reinforcement Learning Based Online 3D Bin Packing Spatial Strategy Optimization
- 2026Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin Packing
- 2025Optimizing 2D+1 Packing in Constrained Environments Using Deep Reinforcement Learning
- 2026Effective Online 3D Bin Packing with Lookahead Parcels Using Monte Carlo Tree Search