ABSTRACT
The two-dimensional bin packing problem (2DBP) is a critical optimization problem in the furniture production and glass cutting industries, where the objective is to cut smaller-sized items from a minimum number of large standard-sized raw materials. In practice, factories manufacture hundreds of customer orders (sets of items) every day, and to relieve pressure in management, a common practice is to group the orders into batches for production, ensuring that items from one order are in the same batch instead of scattered across the production line. In this work, we formulate this problem as the grouped 2D bin packing problem, a bi-level problem where the upper level partitions orders into groups and the lower level solves 2DBP for items in each group. The main challenges are (1) the coupled optimization of upper and lower levels and (2) the high computational efficiency required for practical application. To tackle these challenges, we propose an iteration-based hierarchical reinforcement learning framework, which can learn to solve the optimization problem in a data-driven way and provide fast online performance after offline training. Extensive experiments demonstrate that our method not only achieves the best performance compared to all baselines but is also robust to changes in dataset distribution and problem constraints. Finally, we deployed our method in the ARROW Home factory in China, resulting in a 4.1% reduction in raw material costs. We have released the source code and datasets to facilitate future research.
Supplemental Material
- Yassine Adouani, Bassem Jarboui, and Malek Masmoudi. 2018. A Variable Neighborhood Search with Integer Programming for the Zero-One Multiple-Choice Knapsack Problem with Setup. In International Conference on Variable Neighborhood Search.Google Scholar
- Emel Kizilkaya Aydogan, Yılmaz Delice, Ugur Özcan, Cevriye Gencer, and Özkan Bali. 2019. Balancing stochastic U-lines using particle swarm optimization. Journal of Intelligent Manufacturing, Vol. 30 (2019), 97--111.Google ScholarDigital Library
- Brenda S. Baker, Edward G. Coffman, and Ronald L. Rivest. 1980. Orthogonal Packings in Two Dimensions. SIAM J. Comput., Vol. 9 (1980), 846--855.Google ScholarDigital Library
- Jose Alejandro Cano. 2019. Parameters for a Genetic Algorithm: An Application for the Order Batching Problem. IBIMA Business Review (2019).Google Scholar
- Ivan A. Davydov and Yury A. Kochetov. 2015. VNS-based heuristic with an exponential neighborhood for the server load balancing problem. Electron. Notes Discret. Math., Vol. 47 (2015), 53--60.Google ScholarCross Ref
- Emanuel Falkenauer. 1994. A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems. Evolutionary Computation, Vol. 2 (1994), 123--144.Google ScholarDigital Library
- Jie Fang, Yunqing Rao, Xusheng Zhao, and Bing Du. 2023. A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems. Mathematics (2023).Google Scholar
- Kamyla Maria Ferreira and Thiago Alves de Queiroz. 2018. Two effective simulated annealing algorithms for the Location-Routing Problem. Appl. Soft Comput., Vol. 70 (2018), 389--422.Google ScholarCross Ref
- M. R. Garey and David S. Johnson. 1978. Computers and Intractability: A Guide to the Theory of NP-Completeness.Google Scholar
- Fernando Garza-Santisteban, Roberto Sánchez-Pámanes, Luis Antonio Puente Rodríguez, Iván Amaya, José carlos Ortíz-Bayliss, Santiago Enrique Conant-Pablos, and Hugo Terashima-Marín. 2019a. A Simulated Annealing Hyper-heuristic for Job Shop Scheduling Problems. 2019 IEEE Congress on Evolutionary Computation (CEC) (2019), 57--64.Google ScholarDigital Library
- Fernando Garza-Santisteban, Roberto Sánchez-Pámanes, Luis Antonio Puente Rodríguez, Iván Amaya, José carlos Ortíz-Bayliss, Santiago Enrique Conant-Pablos, and Hugo Terashima-Marín. 2019b. A Simulated Annealing Hyper-heuristic for Job Shop Scheduling Problems. 2019 IEEE Congress on Evolutionary Computation (CEC) (2019), 57--64.Google ScholarDigital Library
- José Fernando Gonçalves. 2007. A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur. J. Oper. Res., Vol. 183 (2007), 1212--1229.Google ScholarCross Ref
- Eleni Hadjiconstantinou and Nicos Christofides. 1995. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research, Vol. 83 (1995), 39--56.Google ScholarCross Ref
- Jie Jia, Huiliang Shang, and Xiong Chen. 2022. Robot Online 3D Bin Packing Strategy Based on Deep Reinforcement Learning and 3D Vision. 2022 IEEE International Conference on Networking, Sensing and Control (ICNSC) (2022), 1--6.Google ScholarCross Ref
- Yuan Jiang, Zhiguang Cao, and Jie Zhang. 2021. Learning to Solve 3-D Bin Packing Problem via Deep Reinforcement Learning and Constraint Programming. IEEE transactions on cybernetics, Vol. PP (2021).Google Scholar
- Jukka Jylä;nki. 2010. A thousand ways to pack the bin-a practical approach to two-dimensional rectangle bin packing. retrived from http://clb. demon. fi/files/RectangleBinPack. pdf (2010).Google Scholar
- R. Kamalakannan, R. Sudhakara Pandian, and Pl. Sivakumar. 2019. A simulated annealing for the cell formation problem with ratio level data. International Journal of Enterprise Network Management (2019).Google ScholarCross Ref
- T. Kampke. 1988. Simulated annealing: Use of a new tool in bin packing. Annals of Operations Research, Vol. 16 (1988), 327--332.Google ScholarDigital Library
- Diederik P. Kingma and Jimmy Ba. 2014. Adam: A Method for Stochastic Optimization. CoRR, Vol. abs/1412.6980 (2014).Google Scholar
- Wouter Kool, Herke van Hoof, and Max Welling. 2018. Attention, Learn to Solve Routing Problems!. In International Conference on Learning Representations.Google Scholar
- Olyvia Kundu, Samrat Dutta, and S. Kumar. 2019Deep-Pack: A Vision-Based 2D Online Bin Packing Algorithm with Deep Reinforcement Learning. 2019 28th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN) (2019), 1--7.Google ScholarDigital Library
- Yeong-Dae Kwon, Jinho Choo, Byoungjip Kim, Iljoo Yoon, Seungjai Min, and Youngjune Gwon. 2020. POMO: Policy Optimization with Multiple Optima for Reinforcement Learning. ArXiv, Vol. abs/2010.16011 (2020).Google Scholar
- T. W. Leung, Chi Kin Chan, and Marvin D. Troutt. 2003. Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res., Vol. 145 (2003), 530--542.Google ScholarCross Ref
- Shengcai Liu, Ke Tang, and Xin Yao. 2020. Memetic Search for Vehicle Routing with Simultaneous Pickup-Delivery and Time Windows. ArXiv, Vol. abs/2011.06331 (2020).Google Scholar
- Andrea Lodi, Silvano Martello, and Daniele Vigo. 2004. Models and Bounds for Two-Dimensional Level Packing Problems. Journal of Combinatorial Optimization, Vol. 8 (2004), 363--379.Google ScholarCross Ref
- Vahid Mahmoodian, Armin Jabbarzadeh, Hassan Rezazadeh, and Farnaz Barzinpour. 2019. A novel intelligent particle swarm optimization algorithm for solving cell formation problem. Neural Computing and Applications, Vol. 31 (2019), 801--815.Google ScholarDigital Library
- Silvano Martello and Daniele Vigo. 1998. Exact Solution of the Two-Dimensional Finite Bon Packing Problem. Management Science, Vol. 44 (1998), 388--399.Google ScholarDigital Library
- Óscar Oliveira, Dorabela Gamboa, and Elsa Silva. 2022. An introduction to the two-dimensional rectangular cutting and packing problem. International Transactions in Operational Research (2022).Google Scholar
- Zeping Pei, Zhuan Wang, and Yiwen Yang. 2019. Research of Order Batching Variable Neighborhood Search Algorithm based on Saving Mileage. Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019) (2019).Google ScholarCross Ref
- Aaron Valero Puche and Sukhan Lee. 2022. Online 3D Bin Packing Reinforcement Learning Solution with Buffer. 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (2022), 8902--8909.Google ScholarCross Ref
- Jakob Puchinger and Günther R. Raidl. 2007. Models and algorithms for three-stage two-dimensional bin packing. Eur. J. Oper. Res., Vol. 183 (2007), 1304--1327.Google ScholarCross Ref
- Jin Qin, Xianhao Xu, Qinghua Wu, and T. C. Edwin Cheng. 2016. Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem. Comput. Oper. Res., Vol. 66 (2016), 199--214.Google ScholarDigital Library
- Octavio Ramos-Figueroa, Marcela Quiroz-Castellanos, Efrén Mezura-Montes, and Oliver Schütze. 2020. Metaheuristics to solve grouping problems: A review and a case study. Swarm Evol. Comput., Vol. 53 (2020), 100643.Google ScholarCross Ref
- Daniel Schermer, Mahdi Moeini, and Oliver Wendt. 2019. A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations. Comput. Oper. Res., Vol. 109 (2019), 134--158.Google ScholarDigital Library
- John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal Policy Optimization Algorithms. ArXiv, Vol. abs/1707.06347 (2017).Google Scholar
- Ashish Vaswani, Noam M. Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is All you Need. ArXiv, Vol. abs/1706.03762 (2017).Google Scholar
- Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer Networks. In NIPS.Google Scholar
- Lijun Wei, Andrew Lim, and Wenbin Zhu. 2011. A Skyline-Based Heuristic for the 2D Rectangular Strip Packing Problem. In International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems.Google ScholarCross Ref
- Manzil Zaheer, Satwik Kottur, Siamak Ravanbakhsh, Barnabás Póczos, Ruslan Salakhutdinov, and Alex Smola. 2017. Deep Sets. ArXiv, Vol. abs/1703.06114 (2017).Google Scholar
- Hang Zhao, Qijin She, Chenyang Zhu, Y. Yang, and Kai Xu. 2020. Online 3D Bin Packing with Constrained Deep Reinforcement Learning. ArXiv, Vol. abs/2006.14978 (2020).Google Scholar
Index Terms
- Learning to Solve Grouped 2D Bin Packing Problems in the Manufacturing Industry
Recommendations
On Lazy Bin Covering and Packing problems
In this paper, we study two interesting variants of the classical bin packing problem, called Lazy Bin Covering (LBC) and Cardinality Constrained Maximum Resource Bin Packing (CCMRBP) problems. For the offline LBC problem, we first prove the ...
Comments