The rapid expansion of fresh produce e-commerce demands efficient warehouse network optimization. This paper employs mixed-integer programming (MIP) to minimize logistics costs and uses the Seasonal Autoregressive Integrated Moving Average (SARIMA) model [1] for order forecasting. For the static warehouse network layout, we formulate an MIP model using order demand data. By applying the branch-and-bound method with the Gurobi solver, we determine the optimal logistics plans, resulting in 6 RDC’s (8 warehouses) and a total logistics cost of 9.9029 million yuan. For order forecasting, we compare the Error-Trend-Seasonality (ETS), Random Forest, and SARIMA models, selecting SARIMA for its superior accuracy with an 80/20 training-validation split. For the dynamic multi-period layout, we simulate demand using an empirical distribution function (EDF) with fluctuations. By integrating short-term historical data analysis and long-term forecast validation, we identify 6 robust, mandatory RDC’s locations.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Optimizing Fresh Warehouse Networks Using MIP and SARIMA Forecasting

  • Mingyu Qi,
  • Jingying Chen,
  • Yunlong Yang

摘要

The rapid expansion of fresh produce e-commerce demands efficient warehouse network optimization. This paper employs mixed-integer programming (MIP) to minimize logistics costs and uses the Seasonal Autoregressive Integrated Moving Average (SARIMA) model [1] for order forecasting. For the static warehouse network layout, we formulate an MIP model using order demand data. By applying the branch-and-bound method with the Gurobi solver, we determine the optimal logistics plans, resulting in 6 RDC’s (8 warehouses) and a total logistics cost of 9.9029 million yuan. For order forecasting, we compare the Error-Trend-Seasonality (ETS), Random Forest, and SARIMA models, selecting SARIMA for its superior accuracy with an 80/20 training-validation split. For the dynamic multi-period layout, we simulate demand using an empirical distribution function (EDF) with fluctuations. By integrating short-term historical data analysis and long-term forecast validation, we identify 6 robust, mandatory RDC’s locations.