Bin Packing Optimization via Deep Reinforcement Learning

The bin packing problem (BPP) has attracted enthusiastic research interest recently, owing to its widespread applications in logistics and warehousing environments. It is truly essential to optimize the bin packing to enable more objects to be packed into bins, in which the object packing order and placement position are the two crucial optimization goals. However, existing optimization methods for BPP, such as the genetic algorithm (GA), emerge as the primary issues in highly time cost and relatively low accuracy, making it difficult to implement in realistic scenarios. To well relieve related research gaps, we present a novel optimization method of 2D and 3D BPP for objects with regular shapes via deep reinforcement learning (DRL), maximizing the space utilization and minimizing the usage number of bins. 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 determine the placement positions of the ordered objects in the bins, preventing the objects from colliding with bins and other objects in bins. Third, the reward and loss functions are defined as the indicators of the compactness, pyramid, and usage number of bins to conduct the DRL neural network training based on an on-policy actor-critic framework. Finally, we conduct extensive experiments to evaluate the performance of the proposed method, and demonstrate that our method achieves a 3% improvement and more than <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$50 \times $</tex-math></inline-formula> time saving over the GA. Further, an experiment on robotic packing is implemented to validate its generalization capacity in the realistic environment.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2025-01-27
DOI
https://doi.org/10.1109/lra.2025.3534070
Citations
10
Primary Topic
Optimization and Packing Problems
Type
article
Field-Weighted Citation Impact
12.42

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bin Packing Optimization via Deep Reinforcement Learning

Huixu Dong, B.S. Wang, Zhaohui Lin, Weijie Kong
10 citations
IEEE Robotics and Automation Letters
Optimization and Packing Problems
12.42
article

Bin Packing Optimization via Deep Reinforcement Learning

Huixu Dong, B.S. Wang, Zhaohui Lin, Weijie Kong
article en
10 citations

Abstract

The bin packing problem (BPP) has attracted enthusiastic research interest recently, owing to its widespread applications in logistics and warehousing environments. It is truly essential to optimize the bin packing to enable more objects to be packed into bins, in which the object packing order and placement position are the two crucial optimization goals. However, existing optimization methods for BPP, such as the genetic algorithm (GA), emerge as the primary issues in highly time cost and relatively low accuracy, making it difficult to implement in realistic scenarios. To well relieve related research gaps, we present a novel optimization method of 2D and 3D BPP for objects with regular shapes via deep reinforcement learning (DRL), maximizing the space utilization and minimizing the usage number of bins. 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 determine the placement positions of the ordered objects in the bins, preventing the objects from colliding with bins and other objects in bins. Third, the reward and loss functions are defined as the indicators of the compactness, pyramid, and usage number of bins to conduct the DRL neural network training based on an on-policy actor-critic framework. Finally, we conduct extensive experiments to evaluate the performance of the proposed method, and demonstrate that our method achieves a 3% improvement and more than <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$50 \times $</tex-math></inline-formula> time saving over the GA. Further, an experiment on robotic packing is implemented to validate its generalization capacity in the realistic environment.

IEEE Robotics and Automation LettersVol. 10(3)
Zhejiang University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 2%
Optimization and Packing Problems
12.42
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.