The tobacco high-bay warehouse, functioning as a buffer warehouse in the cigarette production process, experiences significant fluctuations in space utilization and inbound/outbound operations efficiency due to changes in order types and batch sizes. With its high throughput, improving the warehouse efficiency is a critical issue that needs to be addressed. This paper proposes an integrated optimization method for dynamic storage allocation and inbound/outbound operation scheduling, with the goal of minimizing the completion time of batch inbound and outbound tasks. A dynamic slot allocation model for the overhead storage is developed, and a method is introduced to simultaneously consider both outbound slots and available slots as preferred options for inbound slot selection. To ensure that slots remain vacant during the inbound process, a penalty function is incorporated into the improved genetic algorithm, guaranteeing that inbound operations are only executed when a slot is vacant. The selection of outbound slots is optimized using relative distance, and task sequencing is improved to enhance the efficiency of inbound and outbound operations, reducing stacker crane operation time. The algorithm is applied under different operational conditions. Experimental results show that the proposed integrated optimization method significantly improves the operational efficiency of the overhead storage system. Additionally, the optimized inbound task sequence reduces task completion times and minimizes delays.

1. [1] L. Polten and S. Emde, “Multi-shuttle crane scheduling in automated storage and retrieval systems,” European J. of Operational Research, Vol.302, No.3, pp. 892-908, 2022. https://doi.org/10.1016/j.ejor.2022.01.043
2. [2] L. Chen and Z. Lu, “Optimization for storage location assignments and interleaving problems in an automated storage/retrieval system,” J. of Industrial Engineering and Engineering Management, Vol.26, No.1, pp. 42-47, 2012 (in Chinese).
3. [3] A. Cai, J. Ying, J. Wang et al., “Scheduling model of crane in distributed automated warehouse,” Computer Integrated Manufacturing Systems, Vol.22, No.3, pp. 793-799, 2016 (in Chinese).
4. [4] H. C. Hwang and J. Kang, “An improved algorithm for the lot-sizing problem with outbound shipment,” Omega, Vol.100, Article No.102205, 2021. https://doi.org/10.1016/j.omega.2020.102205
5. [5] S. Emde, L. Polten, and M. Gendreau, “Logic-based benders decomposition for scheduling a batching machine,” Computers & Operations Research, Vol.113, Article No.104777, 2020. https://doi.org/10.1016/j.cor.2019.104777
6. [6] X. Zhang, Y. Chen, and P. Wang, “Application of genetic algorithm in path optimization of stacker,” J. of Anhui Polytechnic University, Vol.34, No.6, pp. 33-38, 2019 (in Chinese).
7. [7] J. L. Heskett, “Cube-per-order index: A key to warehouse stock location,” Transportation and Distribution Management, Vol.3, No.1, pp. 27-31, 1963.
8. [8] A. Silvaa, L. C. Coelhoa, M. Darvisha, and J. Renauda, “Integrating storage location and order picking problems in warehouse planning,” Transportation Research Part E, Vol.140, pp. 1-22, 2020. https://doi.org/10.1016/j.tre.2020.102003
9. [9] J. Zhu, W. Zhang, and F. Xue, “Storage location assignment optimization of stereoscopic warehouse based on genetic simulated annealing algorithm,” Computer Applications, Vol.40, No.1, pp. 284-291, 2020 (in Chinese).
10. [10] B. Yan, C. Yan, F. Long et al., “Multi-objective optimization of electronic product goods location assignment in stereoscopic warehouse based on adaptive genetic algorithm,” J. of Intelligent Manufacturing, Vol.29, No.6, pp. 1273-1285, 2018. https://doi.org/10.1007/s10845-015-1177-7
11. [11] A. Cai, X. Xue, S. Guo et al., “Stacker scheduling of layouts for automatic warehouses with double ended,” Chinese J. of Mechanical Engineering, Vol.30, No.6, pp. 735-741, 2019 (in Chinese).
12. [12] Y. Jiao, X. Xing, P. Zhang et al., “Multi-objective storage location allocation optimization and simulation analysis of automated warehouse based on multi-population genetic algorithm,” Concurrent Engineering, Vol.26, No.4, pp. 367-377, 2018. https://doi.org/10.1177/1063293X18796365
13. [13] K. Hachemi, Z. Sari, and N. Ghouali, “A step-by-step dual cycle sequencing method for unit-load automated storage and retrieval systems,” Computers & Industrial Engineering, Vol.63, No.4, pp. 980-984, 2012. https://doi.org/10.1016/j.cie.2012.06.009
14. [14] P. Yang, L. Miao, and M. Qi, “Integrated optimization of storage location assignment and route planning in a multi-shuttle automated storage and retrieval system,” Tsinghua Science and Technology, Vol.51, No.2, pp. 261-266, 2011 (in Chinese).
15. [15] W. Yang, J. Liu, T. Yue et al., “Integrated optimization of location assignment and job scheduling in multi-carrier automated storage and retrieval system,” Computer Integrated Manufacturing Systems, Vol.25, No.1, pp. 247-255, 2019 (in Chinese).
16. [16] L. He, Y. Tao, J. Luo et al., “Job integrated optimization of automated storage/retrieval systems based on two-stage wolf pack algorithm,” Chinese J. of Mechanical Engineering, Vol.33, No.21, pp. 2538-2546, 2022 (in Chinese).
17. [17] M. L. Li, E. Wolf, and D. Wintz, “Duration-of-Stay Storage Assignment under Uncertainty,” Int. Conf. on Learning Representations (ICLR), 2020.
18. [18] A. Rimélé, P. Grangier, M. Gamache et al., “E-commerce warehousing: Learning a storage policy,” arXiv:2101.08828, 2021. https://doi.org/10.48550/arXiv.2101.08828
19. [19] F. Berns, T. Ramsdorf, and C. Beecks, “Machine learning for storage location prediction in industrial high bay warehouses,” Proc. of ICPR Int. Workshops and Challenges, Part IV, pp. 650-661, 2021. https://doi.org/10.1007/978-3-030-68799-1
20. [20] J. Schulman, S. Levine, P. Abbeel et al., “Trust region policy optimization,” Proc. of the 32nd Int. Conf. on Machine Learning, Vol.37, pp. 1889-1897, 2015.
21. [21] D. Rao and N. Luo, “Stacker scheduling and repository location recommendation based on multi-task reinforcement learning,” Computer Engineering, Vol.49, No.2, pp. 279-287,295, 2023.