Warehouse Prediction and Planning Based on K-MEANS Algorithm and GA-LSTM

Authors

  • Junyang Xu
  • Yixin Wang
  • Xiya Liu
  • Yuxin Liu
  • Yinxing Zhao
  • Tong Han
  • Dan Wei
  • Qianyue Luo
  • Runqi Zhong
  • Fujia Guo

DOI:

https://doi.org/10.54097/2n0tv009

Keywords:

K-mean clustering; GA-LSTM; SSA (Sparrow Search Algorithm); AROA (Attraction-Repulsion Optimization Algorithm).

Abstract

The purpose of this paper is to study warehouse prediction and planning based on K-means algorithm and GA-LSTM through data analysis and deep learning methods. Firstly, this paper utilizes the inventory and daily sales data and uses K-means clustering analysis to classify the data and verifies the validity of the clustering results by evaluating the indicators. Then, the daily sales volume is predicted based on the LSTM model, and the GA-LSTM is further used for multiple fitting, which yields more stable and accurate prediction results. The dual-objective function model for minimizing the daily rental cost and maximizing the upper capacity limit is established by introducing piecewise constraints and correlation constraints through optimization algorithms (SSA, AROA). The results show that the daily rental cost of warehouse capacity and the capacity cap fluctuate within a reasonable interval in the selected optimization solution, respectively, which verifies the effectiveness and superiority of the proposed method in warehouse planning. The research in this paper provides a new idea of warehousing prediction and planning for e-commerce enterprises, which can effectively improve the accuracy and efficiency of warehousing management and provides a theoretical basis and practical guidance for subsequent inventory optimization and supply chain management.

Downloads

Download data is not yet available.

References

[1] Liu Ying, Yu Ruobing. Research on modern warehouse management strategy based on big data analysis[J]. China Aviation Weekly, 2024, (48): 68-70.

[2] Hu Huaqiang, Wang Xi. Research on reconnaissance data sorting methods based on improved K-mean clustering algorithm [J]. Software, 2024, 45(09): 4-6.

[3] Fei Shanshan, Zhang Zhonglin. Improved genetic algorithm to optimize temporal prediction model for GA-LSTM networks [J/OL]. Computer Engineering and Applications, 1-9 [2024-12-19]. http: // kns. cnki. net/kcms/detail/11.2127.TP.20200528.1414.008.html.

[4] Chu Zheyu, Liu Dan, Zhang Rongbo, et al. Application of sparrow search algorithm and 0-1 planning in fresh storage site selection problem [J]. Automation Applications, 2021, (09): 56-59. DOI: 10. 19769/ j. zdhy.2021.09.015.

[5] ZhaoO Pengjun, Liu Sanyang, LI Chao. Particle swarm optimization algorithm based on attraction-repulsion mechanism [J]. Computer Applications, 2009, 29(02): 542-544+557.

[6] Xie Jing. Research on innovation strategy of marketing path of e-commerce enterprises under the background of knowledge economy [J]. Journal of Taiyuan City Vocational and Technical College, 2024, (11): 20-22. DOI: 10.16227/j.cnki.tycs.2024.0639.

Downloads

Published

25-03-2025