A Data-Driven Approach to the Carton Packing on Pallets Problem: A Case Study of a Cold-Chain Distribution Center
Keywords:
one-dimensional bin packing problem, product arrangement, cold chain logistics, heuristic methodsAbstract
This research focuses on the One-Dimensional Bin Packing Problem under constraints for arranging products on pallets of equal capacity (bins). Typically, such problems aim to minimize the number of pallets used. However, this research defines pallet capacity in terms of stacking height, where the total height of products on a pallet must not exceed a predetermined limit. The objective is not to minimize the number of pallets used, but rather to arrange products in accordance with specified constraints using a fixed number of pallets. This approach aims to reduce operation time for order picking staff, minimize product damage resulting from improper arrangement, and establish standards for a cold storage distribution center. Experimental results using 25 picking lists, applying two heuristic algorithms—First Fit Decreasing (FFD) and Best Fit (BF)—and processing through Python programming, revealed that the First Fit Decreasing method had a lower deviation rate from standard requirements compared to the Best Fit method. Additionally, planning time using the First Fit Decreasing method was less than the actual operation time by an average of 916 seconds per list, or 15 minutes per list, or 6 hours and 15 minutes per day.
References
T.-H. Nguyen, V.-T. Tran, P.-Q. Doan and T.-T. Mac, “A Novel Heuristic Algorithm for Online 3D Bin Packing,” in 2021 The 21st International Conference on Control, Automation and Systems (ICCAS), Jeju, South Korea, 2021, pp. 1993–1997.
H. Carpenter and W. B. Dowsland, “Practical considerations of the pallet-loading problem,” Journal of the Operational Research Society., vol. 36, no. 6, pp. 489–497, 1985.
คทา ประดิษฐวงศ์ และ ธีรศักดิ์ ทะเลทอง, “ขั้นตอนวิธีเชิงพันธุกรรมและการค้นเฉพาะที่สำหรับการแก้ปัญหาการบรรจุผลิตภัณฑ์ในสามมิต,” Veridian E-Journal, Science and Technology Silpakorn University., ปีที่ 3, ฉบับที่ 6, น. 43–56, 2559.
K.-H. Loh, B. Golden and E. Wasil, “Solving the one-dimensional bin packing problem with a weight annealing heuristic,” Computers and Operations Research., vol. 35, no. 7, pp. 2283–2291, 2008.
B. Sun, G. Li, S. Wang, C. Xie, “Two-dimensional bin-packing problem with conflicts and load balancing: A hybrid chaotic and evolutionary particle swarm optimization algorithm,” Computers and Industrial Engineering., vol. 200, pp. 110851, 2025.
F. Gzara, S. Elhedhli and B. C. Yildiz, “The pallet loading problem: Three-dimensional bin packing with practical constraints,” European Journal of Operational Research., vol. 287, no. 3, pp. 1062–1074, 2020.
B. Guo, Y. Zhang, J. Hu, J. Li, F. Wu, Q. Peng and Q. Zhang, “Two-dimensional irregular packing problems: A review,” Frontiers in Mechanical Engineering., vol. 8, 2022.
Q. Zuo, X. Liu and W. K. V. Chan, “A Constructive Heuristic Algorithm for 3D Bin Packing of Irregular Shaped Items,” in 2022 INFORMS International Conference on Service Science, Shenzhen, China, 2022.
D. S. Johnson and M. R. Garey, “A 71/60 theorem for bin packing,” Journal of Complexity, vol. 1, no. 1, pp. 65–106, 1985, doi: 10.1016/0885-064X(85)90022-6.
ธนกฤต ปิยะชยวัศ, อนันต์ มุ่งวัฒนา, และวิสุทธิ์ สุพิทักษ์, “ขั้นตอนวิธีเชิงวิวัฒนาการสำหรับแก้ปัญหาการจัดสรรกล่องสินค้าบนพาเลทหลายขนาด กรณีศึกษา: โรงงานผลิตโคมไฟและอุปกรณ์ส่องสว่าง”, Thai Journal of Operations Research, vol. 5, no. 1, pp. 48–59, 2017.
T. J. Hodgson, “A combined approach to the pallet loading problem,” A I I E Transactions., vol. 14, no. 3, pp. 175–182, 1982.
E. Wessa and A. Atia, “Parallelization of One-Dimensional First Fit Decreasing Algorithm,” in 2021 16th International Conference on Computer Engineering and Systems (ICCES), Cairo, Egypt, 2021, pp. 1–5.
G. Dósa and J. Sgall, “Optimal Analysis of Best Fit Bin Packing,” in 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, 2014, pp. 429-441.
S. Albers, A. Khan and L. Ladewig, “Best fit bin packing with random order revisited,” Algorithmica., vol. 83, pp. 2833–2858, 2021.
J. F. Gonçalves and M. G. C. Resende, “A biased random key genetic algorithm for 2D and 3D bin packing problems,” International Journal of Production Economics., vol. 145, no. 2, pp. 500–510, 2013.
H. Hu, X. Zhang, X. Yan, L. Wang, and Y. Xu, “Solving a new 3D bin packing problem with deep reinforcement learning method,” arXiv:1708.05930 [cs.AI], Aug. 20, 2017. doi: 10.48550/arXiv.1708.05930.
X. Zhao, J. A. Bennell, T. Bektaş and K. Dowsland, “A comparative review of 3D container loading algorithms,” International Transactions in Operational Research., vol. 23, pp. 287–320, 2016.
Y. Ma, Y. Zhou, Q. Fang, S. Xia and W. Chen, “A three-dimensional container loading algorithm for solving logistics packing problem,” EURO Journal on Transportation and Logistics., vol. 14, p. 100167, 2025.
X. Zhao, J.A. Bennell, T. Bektaş, K. Dowsland, “A comparative review of 3D container loading algorithms,” European Journal of Operational Research., vol. 23, no. 1-2, pp. 287–320, 2016.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
